#include<iostream>
#include<algorithm>
using namespace std;

int main(){
  int v[3][51];
  int dp[3][51];
  int g,tmp;

  for(int i=0;i<3;i++){
    for(int j=0;j<51;j++){
      v[i][j] = 10000;
      dp[i][j] = 10000;
    }
  }

  for(int i=0;i<51;i++){
    if(!(i%2)){
      tmp = i/2;
      dp[0][i] = (tmp/5) * 1520 + (tmp%5) * 380;
    }
    if(!(i%3)){
      tmp = i/3;
      v[1][i] = (tmp/4) * 1870 + (tmp%4) * 550;
    }
    if(!(i%5)){
      tmp = i/5;
      v[2][i] = (tmp/3) * 2244 + (tmp%3) * 850;
    }
  }

  for(int i=1;i<3;i++){
    for(int j=0;j<51;j++){
      for(int k=0;k<=j;k++)dp[i][j] = min(dp[i][j],dp[i-1][j-k] + v[i][k]);
    }
  }

  while(1){
    cin >> g;
    if(!g)break;
    cout << dp[2][g/100] << endl;
  }
}