
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<n;i++)
#define loop(i,a,n) for(i=a;i<n;i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef pair<int,int> pii;

int main(void) {
  int i,j,k;
  vi dp(51,INF);
  vi v(6),c(6);
  c[0]=380;
  c[1]=550;
  c[2]=850;
  c[3]=380*4;
  c[4]=550*4*85/100;
  c[5]=850*3*88/100;
  v[0]=2;
  v[1]=3;
  v[2]=5;
  v[3]=10;
  v[4]=12;
  v[5]=15;

  dp[0]=0;

  rep(i,25)rep(j,50)if(dp[j]<INF){
    rep(k,6)if(j+v[k]<=50)
      dp[j+v[k]]=min(dp[j+v[k]],dp[j]+c[k]);
  }

  int n;
  while(1){
    cin>>n;
    if(n==0)break;
    cout<<dp[n/100]<<endl;
  }
}