/**   Created by: Humberto Yusta
          Codeforces User: humbertoyusta
          Country: Cuba
          Copyright��                    */
#include<bits/stdc++.h>
using namespace std;
/// Macros:
#define int long long
#define f first
#define s second
#define db(x) cerr << #x << ": " << (x) << '\n';
#define pb push_back
#define lb lower_bound
#define up upper_bound
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
#define enl '\n'
typedef pair<int,int> ii;
typedef long double ld;
typedef unsigned long long ull;
/// Constraints:
const int maxn = 10010;
const int mod = 1000000000;
const ld eps = 1e-9;
const int inf = ((1ll<<31ll)-1ll);
const int INF = 2000000000000000000ll;
const ld pi = acos(-1);
/// Prime Numbers:
// 2, 173, 179, 181, 197, 311, 331, 737, 1009, 2011, 2027, 3079, 4001, 10037, 10079, 20011, 20089;
// 100003, 100019, 100043, 200003, 200017, 1000003, 1000033, 1000037, 1000081;
// 2000003, 2000029, 2000039, 1000000007, 1000000021, 2000000099;
/// Functions:
#define lg2(x) 31 - __builtin_clz(x)
#define lgx(x,b) ( log(x) / log(b) )
/// Red-Black Tree Template ---------------------------------
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long ,  null_type ,  less<long long> ,  rb_tree_tag ,  tree_order_statistics_node_update > ordered_set;
/// Quick Pow------------------------------------------------
int qpow(int b,int e){
    if( !e ) return 1;
    if( e & 1 ) return qpow(b,e-1) * b;
    int pwur = qpow(b,e>>1);
    return pwur * pwur;
}
int modinv(int x){
    return qpow(x,mod-2);
}
/// My Code -------------------------------------------------

int tc;
ld n, a, b, c, d;
priority_queue<pair<ld,int>> q;
map<int,ld> dp;

ld dijkstra(){
    dp.clear();
    while( !q.empty() ) q.pop();
    q.push({-1,n});
    dp[n] = 1;
    while( !q.empty() ){
        int u = q.top().s;
        ld w = -q.top().f;//db(u)
        q.pop();//db(w)
        if( u == 0 ) return w - 1;
        if( u % 2 == 0 ){
            if( dp[u/2] > dp[u] + min(a,u/2*d) || !dp[u/2] ){
                dp[u/2] = dp[u] + min(a,u/2*d);
                q.push({-dp[u/2],u/2});
            }
        }
        if( u % 3 == 0 ){
            if( dp[u/3] > dp[u] + min(b,u*2/3*d) || !dp[u/3] ){
                dp[u/3] = dp[u] + min(b,u*2/3*d);
                q.push({-dp[u/3],u/3});
            }
        }
        if( u % 5 == 0 ){
            if( dp[u/5] > dp[u] + min(c,u*4/5*d) || !dp[u/5] ){
                dp[u/5] = dp[u] + min(c,u*4/5*d);
                q.push({-dp[u/5],u/5});
            }
        }
        if( ( u % 2 || u % 3 ) || u % 5 ){
            if( dp[u-1] > dp[u] + d || !dp[u-1] ){
                dp[u-1] = dp[u] + d;
                q.push({-dp[u-1],u-1});
            }
            if( dp[u+1] > dp[u] + d || !dp[u+1] ){
                dp[u+1] = dp[u] + d;
                q.push({-dp[u+1],u+1});
            }
        }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout.setf(ios::fixed); cout.precision(0);
    srand(time(NULL));

    //freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);

    cin >> tc;
    while( tc-- ){
        cin >> n >> a >> b >> c >> d;
        cout << dijkstra() << '\n';
    }

    return 0;
}


Measured memory_bytes: 9928