#include<iostream>
using namespace std;
#define INF (1<<30)-1
int main(){
  int s[6]={2,3,5,10,12,15};
  int n[6]={380,550,850,1520,1870,2244};
  int m;
  while(cin>>m){
    if(m==0) break;
    m /= 100;
    int dp[m+1];
    for(int i=0;i<=m;i++) dp[i] = INF;
    dp[0] = 0;
    for(int i=5;i>=0;i--){
      for(int j=0;j<=m;j++){
	if(j+s[i]<=m&&dp[j]!=INF) dp[j+s[i]] = min(dp[j+s[i]],dp[j]+n[i]);
      }
    }
    cout << dp[m] << endl;
  }
  return 0;
} 