a=[2,3,5,10,12,15]

b=[380,550,850,1520,1870,2244]

while 1:

    n=int(eval(input()))

    if n==0:break

    n//=100

    dp=[0]+[1<<29]*n

    for i in range(5,-1,-1):

        for j in range(n+1):

            if j+a[i]<=n and dp[j]!=1<<29:dp[j+a[i]]=min(dp[j+a[i]],dp[j]+b[i])

    print((dp[n]))
a=[(2,380),(3,550),(5,850),(10,1520),(12,1870),(15,2244)]

dp=[1<<20]*51

for i,j in a:

    dp[i]=j

    for k in range(51-i):

        if dp[k]!=1<<20 and dp[k+i]>dp[k]+j:

            dp[k+i]=dp[k]+j

while 1:

    n=int(eval(input()))

    if n==0:break

    print((dp[n//100]))
a = [2, 3, 5, 10, 12, 15]
b = [380, 550, 850, 1520, 1870, 2244]
while 1:
    n = int(eval(input()))
    if n == 0:
        break
    n //= 100
    dp = [0] + [1 << 29] * n
    for i in range(5, -1, -1):
        for j in range(n + 1):
            if j + a[i] <= n and dp[j] != 1 << 29:
                dp[j + a[i]] = min(dp[j + a[i]], dp[j] + b[i])
    print((dp[n]))

a = [(2, 380), (3, 550), (5, 850), (10, 1520), (12, 1870), (15, 2244)]
dp = [1 << 20] * 51
for i, j in a:
    dp[i] = j
    for k in range(51 - i):
        if dp[k] != 1 << 20 and dp[k + i] > dp[k] + j:
            dp[k + i] = dp[k] + j
while 1:
    n = int(eval(input()))
    if n == 0:
        break
    print((dp[n // 100]))

-a = [2, 3, 5, 10, 12, 15] -b = [380, 550, 850, 1520, 1870, 2244] +a = [(2, 380), (3, 550), (5, 850), (10, 1520), (12, 1870), (15, 2244)] +dp = [1 << 20] * 51 +for i, j in a: +    dp[i] = j +    for k in range(51 - i): +        if dp[k] != 1 << 20 and dp[k + i] > dp[k] + j: +            dp[k + i] = dp[k] + j -    n //= 100 -    dp = [0] + [1 << 29] * n -    for i in range(5, -1, -1): -        for j in range(n + 1): -            if j + a[i] <= n and dp[j] != 1 << 29: -                dp[j + a[i]] = min(dp[j + a[i]], dp[j] + b[i]) -    print((dp[n])) +    print((dp[n // 100]))