#include <iostream>
#include <algorithm>
using namespace std;

const int INF = 1 << 30;
int ans[51];

int main() {
    fill_n(ans, 51, INF);
    for (int a = 0; a < 26; a++) {
        for (int b = 0; b < 19; b++) {
            for (int c = 0; c < 11; c++) {
                int idx = 2 * a + 3 * b + 5 * c;
                if (idx > 50) {
                    continue;
                }
                int a1 = a / 5, a2 = a % 5;
                int b1 = b / 4, b2 = b % 4;
                int c1 = c / 3, c2 = c % 3;
                ans[idx] = min(ans[idx], 1520*a1 + 380*a2 + 1870*b1 + 550*b2 + 2244*c1 + 850*c2);
            }
        }
    }
    int n;
    while (cin >> n, n) {
        cout << ans[n/100] << endl;
    }
}