#include <iostream>

using namespace std;

const int INF = 2<<20;

int main(){
	int w[] = {2, 3, 5};
	int v[] = {380, 550, 850};
	int disn[] = {5, 4, 3};
	double disp[] ={0.2, 0.15, 0.12};

	int lowest[55];
	fill(lowest, lowest+55, INF);
	lowest[0] = 0;

	for(int i = 0; i < 3; i++){
		for(int j = 0; j < 50; j++){
			for(int k = 1; j + w[i]*k <= 50; k++){
				int n = k - k%disn[i];
				lowest[j+w[i]*k] = min(lowest[j+w[i]*k], lowest[j]+v[i]*(k-n)+(int)(v[i]*n*(1.0-disp[i])));
			}
		}
	}

	int n;
	while(cin >> n, n){
		n/=100;
		cout << lowest[n] << endl;
	}

	return 0;
}