#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	int dp[5010];
	memset(dp, 0x3f, sizeof(dp));
	dp[0] = 0;
	int a[3] = { 200,300,500 },
		b[3] = { 380,550,850 },
		c[3] = { 5,4,3 };
	double d[3] = { 0.8,0.85,0.88 };
	rep(h, 0, 3) {
		rep(i, 1, 30) {
			int m = a[h] * i;
			int p = b[h] * (i / c[h])*c[h] * d[h] + b[h] * (i%c[h]);
			rep(j, 0, 5010 - m) {
				dp[j + m] = min(dp[j + m], dp[j] + p);
			}
		}
	}
	for (int n; cin >> n&&n;) {
		cout << dp[n] << endl;
	}
	return 0;
}