#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;

int main(){
	int w[6] = {2,10,3,12,5,15}, v[6] = {380,380*5*0.8,550,550*4*0.85,850,850*3*0.88};
	int N;
	while(cin>>N,N){
		N /= 100;
		int dp[51]; fill_n(dp,51,INT_MAX/2); dp[0] = 0;
		for(int i=0;i<N;i++){
			for(int j=0;j<6;j++){
				if(i+w[j]<=N) dp[i+w[j]] = min(dp[i+w[j]],dp[i]+v[j]);
			}
		}
		printf("%d\n",dp[N]);
	}
}