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

const int INF = 1<<30;
int w[6] = {2, 3, 5, 10, 12, 15};
int v[6] = {380, 550, 850, 1520, 1870, 2244};
int dp[51];

int main(){
    int i,j;
    dp[0] = 0;
    for(i = 1; i <= 51; i++) dp[i] = INF;
    for(i = 0; i < 6; i++){
        for(j = w[i]; j <= 50; j++){
            dp[j] = min(dp[j], dp[ j-w[i] ] + v[i]);
        }
    }
    while(cin>>i,i) cout << dp[i/100] << endl;
    return 0;
}