#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <sstream>
#include <fstream>
#include <string.h>

#define X first
#define Y second
#define MP make_pair
#define FOR(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
const int MAX = 101;

template<class T, class U>
void convert(T &t, U &u){
    stringstream ss;
    ss << t;
    ss >> u;
}

int dp[51];

int main(){
	int w[]={0, 2, 3, 5, 2*5, 3*4, 5*3};
	int m[]={1<<29, 380, 550, 850, 5*380*0.8, 4*550*0.85, 3*850*0.88};

	fill(dp+1, dp+51, 1<<29);

	for(int i = 1; i <= 50; i++){ 
		for(int j = 1 ; j <= 6; j++){
			if(i>=w[j]){
				dp[i] = min(dp[i], dp[i-w[j]]+m[j]);
			}
		}
	}

	int n;
	while(cin >> n && n!=0){
		cout << dp[n/100] << endl;
	}

	return 0;
}