#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<bitset>
#include<functional>
#include<climits>
using namespace std;
typedef pair<int,int>pii;
const int INF=1e9;
const int dx[]={0,-1,0,1},dy[]={-1,0,1,0};


int main(){
    int n;
    int w[6]={2,3,5,10,12,15};
    int v[6]={380,550,850,380*5*80/100,550*4*85/100,850*3*88/100};
    while(scanf("%d",&n),n){
        n/=100;
        int dp[51];fill_n(dp,51,1<<25);
        dp[0]=0;
        for(int i=1;i<=n;i++){
            for(int j=0;j<6;j++){
                if(i-w[j]<0)continue;
                dp[i]=min(dp[i],dp[i-w[j]]+v[j]);
            }
        }
        printf("%d\n",dp[n]);
    }
    return 0;
}