#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int IINF = INT_MAX;

int main() {
    int dp[55];
    fill(dp,dp+55,IINF/2);
    dp[0] = 0;
    for(int i=2;i<=50;i++){
        dp[i] = dp[i-2] + 380;
        if(i>=3) dp[i] = min(dp[i], dp[i-3] + 550);
        if(i>=5) dp[i] = min(dp[i], dp[i-5] + 850);
        if(i>=10) dp[i] = min(dp[i], dp[i-10] + 1520);
        if(i>=12) dp[i] = min(dp[i], dp[i-12] + 1870);
        if(i>=15) dp[i] = min(dp[i], dp[i-15] + 2244);
    }
    int n;
    while(cin >> n, n){
        cout << dp[n/100] << endl;
    }
    return 0;
}
