import std.stdio,std.string,std.conv,std.algorithm;

int main()
{
	int dp[5001];
	foreach(i;0..5001) dp[i] = 1000000;

	int p[6] = [200,300,500,1000,1200,1500];
	int v[6] = [380, 550, 850,1520,1870,2244];

	dp[0] = 0;

	foreach(i;0..6)
	{
		foreach(j;0..5001)
		{
			int x = p[i] + j;
			if(x < 5001)
			{
				dp[x] = min(dp[x],dp[j]+v[i]);
			}
		}
	}

	while(true)
	{
		int n = readln.chomp.to!int;
		if(n == 0) break;

		dp[n].writeln;

	}

	return 0;
}