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

#define MAX_N 10000

int dp[4][10000], cnt, cnt2;
int v[3] = { 2,3,5 }, w[3] = { 380,550,850 }, x[3] = { 5,4,3 }, y[3] = { 20,15,12 };

int main() {
	memset(dp, 127, sizeof(dp));
	dp[0][0] = 0;
	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < MAX_N; j++) {
			cnt = 0; cnt2 = 0;
			for (int k = j; k < MAX_N; k += v[i]) {
				dp[i + 1][k] = min(dp[i + 1][k], dp[i][j] + cnt);
				cnt += w[i];
				cnt2++;
				if (cnt2%x[i] == 0) {
					cnt -= (w[i] * x[i])*y[i] / 100;
				}
			}
		}
	}
	while (true) {
		int n;
		cin >> n;
		if (n == 0) { break; }
		cout << dp[3][n / 100] << endl;
	}
	return 0;
}