#include <iostream>
using namespace std;
int main() {
	int g[6] = {2,3,5,10,12,15};
	int p[6] = {380,550,850,1520,1870,2244};
	int dp[66];
	for (int &i : dp) i = 10e6;
	dp[0] = 0;
	for (int i=0; i<6; ++i) {
		for (int j=0; j<51; ++j) {
			int k = j+g[i];
			if (dp[j]!=10e6) {
				dp[k] = min(dp[k], dp[j]+p[i]);
			}
		}
	}
	int n;
	while (cin >> n && n!=0) {
		cout << dp[n/100] << endl;
	}
	return 0;
}