#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; ++i)
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define P pair<int, int>
const int N = 5100;
const int INF = (1 << 30);

int main() {
  vector<int> v(N, INF);
  v[0] = 0;
  for(int i = 0; i < N; i += 100){
    if(v[i] == INF) continue;
    if(i + 200 < N) v[i + 200] = min(v[i + 200], v[i] + 380);
    if(i + 300 < N) v[i + 300] = min(v[i + 300], v[i] + 550);
    if(i + 500 < N) v[i + 500] = min(v[i + 500], v[i] + 850);
    if(i + 1000 < N) v[i + 1000] = min(v[i + 1000], v[i] + 1520);
    if(i + 1200 < N) v[i + 1200] = min(v[i + 1200], v[i] + 1870);
    if(i + 1500 < N) v[i + 1500] = min(v[i + 1500], v[i] + 2244);
  }
  int n;
  while(cin >>n && n) cout <<v[n] <<endl;
}