#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <deque>
 
using namespace std;
 
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define rep(i,n) REP(i,0,n);
#define pb(n) push_back(n)
#define mp(n,m) make_pair(n, m)
#define all(r) r.begin(),r.end()
#define fi first
#define se second
#define println(X) cout<<X<<endl;

#define Rep(i) for(int i  =1; i <= 30; i++)
 
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int INF = 1e9;


int main(){
	pii p[6];
	p[0] = mp(2, 380);
	p[1] = mp(3, 550);
	p[2] = mp(5, 850);
	p[3] = mp(2*5, 380*5*0.8);
	p[4] = mp(3*4, 550*4*0.85);
	p[5] = mp(5*3, 850*3*0.88);

	int dp[100];
	int w;
	while(cin>>w&&w){
		w/=100;
		for(int i = 0; i <= w; i++){
			dp[i] = INF;
		}
		dp[0]=0;
		for(int i = 0; i < 6; i++){
			for(int j = p[i].fi; j <= w; j++){
				dp[j]=min(dp[j], dp[j-p[i].fi]+p[i].se);
			}
		}
		cout<<dp[w]<<endl;
	}
}