#include <cstdio>
#include <algorithm>
using namespace std;

#define INF 0x33433433

int m;
int ws[] = {15, 12, 10, 5, 3, 2, 1};
int vs[] = {2244, 1870, 1520, 850, 550, 380, 380};
int dp[7][51];

int main() {
  while (1) {
    scanf("%d", &m);
    if (m == 0) return 0;

    for (int i=0; i<7; i++) {
      for (int j=0; j<=50; j++) {
        dp[i][j] = INF;
      }
    }

    dp[0][0] = 0;
    for (int i=0; i<6; i++) {
      for (int j=0; j<=50; j++) dp[i+1][j] = dp[i][j];
      for (int j=0; j<=50-ws[i]; j++) {
        dp[i+1][j+ws[i]] = min(dp[i+1][j]+vs[i], dp[i+1][j+ws[i]]);
      }
    }
    printf("%d\n", dp[6][m/100]);
  }
}