#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int x;
    while(cin >> x, x){
        int ans = INF<int>;
        for (int i = 0; i*200 <= x; ++i) {
            for (int j = 0; i*200+j*300 <= x; ++j) {
                if((x-i*200-j*300)%500) continue;
                int k = (x-i*200-j*300)/500;
                ans = min(ans, i/5*1520+i%5*380+j/4*1870+j%4*550+k/3*2244+k%3*850);
            }
        }
        cout << ans << "\n";
    }
    return 0;
}
