#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef pair<ll , ll> lli;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
typedef vector<lli> vlli;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define PI 3.14159265359
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcountll(n)

const ll mod = (ll)100000007;
const ll maxn = (ll)1005;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = 1e18;

ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};

ll a,b,c,d,fun,last;
map < ll , ll > m;
bool amt(ll pro){
	if(last >= pro) return 1;
	else return 0;
}
ll dp(ll n, ll p){
	if(n == 0) return 0;
    if(m[n] != 0) return m[n];
    ll ans = INF;
    for(ll i = n-5; i <= n+5; i++){
    	if(i < 0) continue;
    	ll diff = abs(i-n);
    	if(i == 0){
    		ans = min(ans , diff*d);
    		continue;
		}
		if(i == p) continue; 
		if(i%2 == 0){
			if(i/2 == n) continue;
			ll kt = i/2;
			ll h = a;
			if(amt(kt)) h = (kt)*d; 
			ans = min(ans , ((diff*d) + min( a , h  ) ) + dp(i/2 , n));
		}
		if(i%3 == 0){
			if(i/3 == n) continue;
			ll kt = 2*(i/3);
			ll h = b;
			if(amt(kt)) h = (kt)*d; 
			ans = min(ans , ((diff*d) + min( b ,h)  ) + dp(i/3 , n) );
		}
		if(i%5 == 0){
			if(i/5 == n) continue;
			ll kt = 4*(i/5);
			ll h = c;
			if(amt(kt)) h = (kt)*d; 
			ans = min(ans , ((diff*d) + min( c , h ) )  + dp(i/5 , n));
		}
	} 
	//cout << n << ' ' << ans << '\n';
	return m[n] = ans;
}

void solve(){ 
    cin >> fun >> a >> b >> c >> d;
    m.clear();
    m[1] = d;
    m[2] = min((d+a) , 2*d);
    m[3] = min( m[2]+d , min(3*d , d + b));
    m[4] = min( min(4*d , d+2*a) , m[3]+d);
    m[5] = min( min(5*d , 2*(d+a)) , min(d+c , 3*d + b));
    last = (fun/d)+1;
    cout << dp(fun, -1) << '\n';
	return;
}


int main() {
   
    //ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    ll T;
    T=1;
    cin >> T;
    //scanf("%lld",&T);
    //ll CT = 0;
    //work();
    while(T--){
    	//cout << "Case " << ++CT <<": " ;
    	//printf("Case %lld: ",++CT);
		solve();
    	
    	
	}
    
    return 0;
}

