#include <bits/stdc++.h>

using namespace std;

#define INF 1001000100010001000
#define MOD 1000000007
#define EPS 1e-10
#define int long long
#define rep(i, N) for (int i = 0; i < N; i++)
#define Rep(i, N) for (int i = 1; i < N; i++)
#define For(i, a, b) for (int i = (a); i < (b); i++)
#define pb push_back
#define eb emplece_back
#define mp make_pair
#define i_i pair<int, int>
#define vi vector<int>
#define vvi vector<vi >
#define vb vector<bool>
#define vvb vector<vb >
#define vp vector< i_i >
#define Edge pair< i_i, int>
#define all(a) (a).begin(), (a).end()
#define Int(x) int x; scanf("%lld", &x);
#define int2(x, y) int x, y; scanf("%lld %lld", &x, &y);
#define fir first
#define sec second
#define ffir first.first
#define fsec first.second
#define sfir second.first
#define ssec second.second
 
//int dxy[5] = {0, 1, 0, -1, 0};
// assign

int dp[50][50][50];
 
signed main()
{
    rep(i, 50) {
        rep(j, 50) {
            rep(k, 50) {
                dp[i][j][k] = (i / 5) * 1520 + (i % 5) * 380 +
                    (j / 4) * 1870 + (j % 4) * 550 +
                    (k / 3) * 2244 + (k % 3) * 850;
            }
        }
    }
    Int(t);
    while (t) {
        int ans = INF;
        t /= 100;
        for (int i = 0; i * 2 <= t; i++) {
            for (int j = 0; i * 2 + j * 3 <= t; j++) {
                if ((t - (i * 2 + j * 3)) % 5) {
                    continue;
                } else {
                    int k = (t - (i * 2 + j * 3)) / 5;
                    ans = min(ans, dp[i][j][k]);
                }
            }
        }
        cout << ans << endl;
        cin >> t;
    }

    return 0;
}