#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

/*
200 380
300 550
500 850
1000 1520
1200 1870
1500 2244
*/

int main() {
	int n;
	while (cin >> n) {
		if (n == 0) {
			break;
		}
		vector< vector<int> > dp(5000+1, vector<int>(6+1, 1000000));
		int w[6] = {200, 300, 500, 1000, 1200, 1500};
		int v[6] = {380, 550, 850, 1520, 1870, 2244};
		dp[0][0] = 0;
		dp[200][1] = 380;
		dp[300][2] = 550;
		dp[500][3] = 850;
		dp[1000][4] = 1520;
		dp[1200][5] = 1870;
		dp[1500][6] = 2244;
		for (int i = 0; i < 6; i++) {
			for (int j = 0; j <= n; j+=100) {
				if (j < w[i]) {
					dp[j][i+1] = dp[j][i];
				} else {
					dp[j][i+1] = min(dp[j][i], dp[j-w[i]][i+1]+v[i]);
				}
			}
		}
		cout << dp[n][6] << endl;
	}
	return 0;
}