#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
#define EPS 1e-10
#define pb push_back
#define mp make_pair
typedef long long ll;
using namespace std;
typedef pair<int, int> P;

bool isLeap(int y);
ll gcd(ll a, ll b);
ll lcm(ll a, ll b);
double distanceAB(double xa, double ya, double xb, double yb);
void trace(int A[], int N);

/*
class Target
{
public:
	vector <string> draw(int n)
	{

	}
};
*/



int main()
{
	int dp[50], g, price, a1, a5, b1, b5, c1, c5, inp;
	
	rep(i, 50) dp[i] = INF;
	
	rep(a, 25) rep(b, 16) rep(c, 10)
	{
		g = 2 * a + 3 * b + 5 * c;
		if (g > 50) continue;
		a1 = a % 5; a5 = a / 5;
		b1 = b % 4; b5 = b / 4;
		c1 = c % 3; c5 = c / 3;
		price = 380*a1 + 1520*a5 + 550*b1 + 1870*b5 + 850*c1 + 2244*c5;
		if (dp[g] > price) dp[g] = price;
	}
	
	while (cin >> inp, inp)
	{
		cout << dp[inp / 100] << endl;
	}
	
	return 0;
}


bool isLeap(int y)
{
	return y % 400 == 0
						? true : y % 100 == 0
						? false : y % 4 == 0
						? true : false;
}

ll gcd(ll a, ll b)
{
	return (b > 0) ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}

void trace(int A[], int N)
{
	REP(N)
	{
		if (i > 0) cout << " ";
		cout << A[i];
	}
	cout << endl;
}

double distanceAB(double xa, double ya, double xb, double yb)
{
	return sqrt((xb-xa)*(xb-xa) + (yb-ya)*(yb-ya));
}