#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt"
int main() {
	int dp[10000];
	for (int i = 0; i < 10000; ++i) {
		dp[i] = 1e9;
	}
	dp[0] = 0;
	for (int i = 0; i <= 50; ++i) {
		for (int j = i + 1; j < 90; ++j) {
			dp[i] = min(dp[i], dp[j]);
		}
		dp[i + 2] = min(dp[i + 2], dp[i] + 380);
		dp[i + 3] = min(dp[i + 3], dp[i] + 550);
		dp[i + 5] = min(dp[i + 5], dp[i] + 850);
		dp[i + 10] = min(dp[i + 10], dp[i] + 380 * 4);
		dp[i + 12] = min(dp[i + 12], dp[i] + 1870);
		dp[i + 15] = min(dp[i + 15], dp[i] + 2244);
	}
	for (int i = 98; i >=0;--i) {
		dp[i] = min(dp[i + 1], dp[i]);
	}
	while (1) {
		int N; cin >> N;
		if (!N)break;
		N /= 100;
		cout << dp[N] << endl;
	}
	return 0;
}