#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************





int consistency(int n, int x, int y, int z, int b){
	
	vector<int> dp(n+1);
	dp[1] = 0;
	
	for(int i=2; i<=n; i++){
		int mini = dp[i-1] + x;
		
		if(i % 3 == 0) mini = min(mini, dp[i/3] + y);
		if(i % 5 == 0) mini = min(mini, dp[i/5] + z);
		if(i % 7 == 0) mini = min(mini, dp[i/7] + b);
		
		dp[i] = mini;
	}

	return dp[n];
}















int practice(int n, int x, int y, int z, int b){


    return 0;
}





void solve() {
    
    int n, x, y, z, b;
    cin>> n >> x >> y >> z >> b;
    
    cout << consistency(n, x, y, z, b) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}