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

const int INF = 1<<30;
int pp[3][30];
int a[3] = {2, 3, 5};
int p[3] = {380, 550, 850};
int u[3] = {5, 4, 3};
int d[3] = {80, 85, 88};
int dp[3][51];

void set(){
    int i,j,k;
    for(i = 0; i < 3; i++){
        int price = 0;
        for(j = 0;j < 30; j++){
            if( j%u[i] == 0 ) price = p[i]*j*d[i]/100; 
            else price += p[i];
            pp[i][j] = price;
        }
    }
    for(i = 0; i < 3; i++){
        for(j = 0; j <= 50; j++){
            dp[i][j] = INF;
        }
    }
    for(i = 0; a[0]*i <= 50; i++){
        dp[0][ a[0]*i ] = pp[0][i];
    }
    for(i = 1; i < 3; i++){
        for(j = 0; j <= 50; j++){
            for(k = 0; j-a[i]*k >= 0;k++){
               dp[i][j] = min(dp[i][j], dp[i-1][j-a[i]*k]+pp[i][k]);
            }
        }
    }
}

int main(){
    int n;
    set();
    while(cin>>n,n) cout << dp[2][n/100] << endl;
    return 0;
}