#include <algorithm>
#include <climits>
#include <iostream>

#define loop for (;;)
#define repeat(i, n) for (int i = 0; i < (n); i++)

using namespace std;

int main() {
  pair<int, int> prices[6] = {
    make_pair(2, 380),
    make_pair(3, 550),
    make_pair(5, 850),
    make_pair(2 * 5, 380 * 5 * 80 / 100),
    make_pair(3 * 4, 550 * 4 * 85 / 100),
    make_pair(5 * 3, 850 * 3 * 88 / 100)
  };
  int dp[51] = {0};
  fill(dp+1, dp+51, 100000);
  for (int i = 2; i <= 50; i++)
    repeat(j, 6)
      if (i - prices[j].first >= 0)
        dp[i] = min(dp[i], dp[i-prices[j].first] + prices[j].second);
      else
        break;
  loop {
    int needed;
    cin >> needed;
    if (!needed) return 0;
    cout << dp[needed / 100] << endl;
  }
}