#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int dp[10][1000];
int w[3] = { 2, 3, 5 };
int v[3] = { 380, 550, 850 };
double r[3] = { 0.8, 0.85, 0.88 };
int d[3] = { 5, 4, 3 };

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	while(cin >> n, n) {
		n /= 100;
		fill((int*)begin(dp), (int*)end(dp), 1e9);
		dp[0][0] = 0;
		for(int i = 0; i < 3; i++) {
			for(int j = 0; j <= n; j++) {
				if(dp[i][j] == 1e9) continue;
				for(int k = 0; j + w[i] * k <= n; k++) {
					int cost = v[i] * (k / d[i]) * d[i] * r[i] + v[i] * (k % d[i]);
					int nj = j + w[i] * k;
					dp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + cost);
				}
			}
		}
		cout << dp[3][n] << endl;
	}
}