#include <iostream>
using namespace std;
#define INF (1 << 30) - 1

int main(){
	int a[6] = {2, 3, 5, 10, 12, 15}, dp[51], n;
	int b[6] = {380, 550, 850, 1520, 1870, 2244};
	for(int i = 0;i < 51;i++)dp[i] = INF;
	dp[0] = 0;
	
	for(int i =  0;i <= 50;i++){
		for(int j = 0;j < 6;j++){
			if(i >= a[j])dp[i] = min(dp[i], dp[i-a[j]] + b[j]);
		}
	}
	while(cin >> n, n)cout << dp[n/100] << endl;
	return 0;
}