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

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()

int main() {
  int a[] = {380, 550, 850, 0.8*380*5, 0.85*550*4, 0.88*850*3};
  int w[] = {200, 300, 500, 200*5, 300*4, 500*3};

  int dp[7][5001] = {1<<30};
  REP(i,7)
    REP(j,5001) {
    dp[i][j] = 9999;
    if (j==0) dp[i][j]=0;
  }
    
  REP(i,6) {
    for (int j=0; j<=5000; j+=100) {
      if (j<w[i])
        dp[i+1][j] = dp[i][j];
      else
        dp[i+1][j] = min(dp[i][j], dp[i+1][j-w[i]] + a[i]);
//      printf("%5d", dp[i+1][j]);
    }
    //  cout << endl;
    
  }
  
  int n;
  while (cin >> n, n) {
    cout << dp[6][n] << endl;
  }
  
}