//#pragma GCC optimize ("O3","unroll-loops")
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cassert>

#include<cmath>
#include<functional>
#include<algorithm>

#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<deque>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<bitset>
#include<tuple>

#define TEST {IS_TEST=true;}
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define mpp(x,y,z) make_pair(make_pair(x,y),z)
#define uppb upper_bound
#define lowb lower_bound

using namespace std;
using ll = int_fast64_t;
using v_b = vector <bool>; using v_ll = vector <ll>; using str = string; using v_str = vector <string>; using p_ll = pair < ll,ll >;
using vv_b = vector < v_b >; using vv_ll = vector < v_ll >; using vp_ll = vector < p_ll >;
using vvv_ll = vector < vv_ll >; using vvp_ll = vector < vp_ll >;
using ld = long double; using v_ld = vector <ld>; using vv_ld = vector<v_ld>;

bool IS_TEST=false;
ll ll_min64=1LL<<63;
ll ll_max64=~ll_min64;
ll ll_min32=1LL<<31;
ll ll_max32=~ll_min32;

ll MOD = 1000000007;

/*displaying functions for debug*/
template<class T> void show2(const T &x){cerr << x;}
template<class T1,class T2> void show2(const pair<T1,T2> &x){
  cerr << "{" << show2(x.first) << "," << show2(x.second) << "}";
}
template<class T> void show(const T &x){
  if (!IS_TEST) return; show2(x); cerr << "\n";
}
template<class T> void v_show(const T &v, ll n=-1){
  if (!IS_TEST) return; auto itr=v.begin(); ll m=n;
  while(itr!=v.end() && m!=0 ){ show2(*itr); cerr << " "; itr++; m--;}
  cerr << "\n";
}
template<class T> void vv_show(const T &v, ll n=-1){
  if (!IS_TEST) return;
  cerr << "--------------------------------\n";
  auto itr=v.begin(); ll m=n;
  while(itr!=v.end() && m!=0 ){ v_show(*itr,n); itr++; m--;}
  cerr << "--------------------------------\n";
}
/*--------------------------------*/

/*loading integers*/
void load(ll& x1){ cin >> x1; }
void load(ll& x1,ll& x2){ cin >> x1 >> x2; }
void load(ll& x1,ll& x2,ll& x3){ cin >> x1 >> x2 >> x3; }
void load(ll& x1,ll& x2,ll& x3,ll& x4){ cin >> x1 >> x2 >> x3 >> x4; }
void v_load(ll n, v_ll& v1, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld",&v1[i+head]); }
}
void v_load(ll n, v_ll& v1 ,v_ll& v2, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init); v2.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld%lld",&v1[i+head],&v2[i+head]); }
}
void v_load(ll n, v_ll& v1 ,v_ll& v2, v_ll& v3, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init); v2.assign(m,init); v3.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld%lld%lld",&v1[i+head],&v2[i+head],&v3[i+head]); }
}
void v_load(ll n, v_ll& v1 ,v_ll& v2, v_ll& v3, v_ll& v4, ll head=0, ll tail=0, ll init=0){
    ll m=n+head+tail; v1.assign(m,init); v2.assign(m,init); v3.assign(m,init); v4.assign(m,init);
    for (ll i=0;i<n;i++){ scanf("%lld%lld%lld%lld",&v1[i+head],&v2[i+head],&v3[i+head],&v4[i+head]); }
}
/*--------------------------------*/

/*output*/
template <class T>void put(T x){cout << x << "\n";}
template <class T1,class T2>void put(T1 x,T2 y){cout << x << " " << y << "\n";}
/*---*/

v_ll local_sort(ll x1=ll_max64, ll x2=ll_max64, ll x3=ll_max64, ll x4=ll_max64){
    v_ll x{x1,x2,x3,x4};
    sort(x.begin(),x.end());
    return x;
}

ll max(ll x,ll y){return x>y?x:y;}
ll min(ll x,ll y){return x<y?x:y;}

ll max(v_ll::iterator b,v_ll::iterator e){
    ll ans=*b;
    while (b<e) {ans=max(ans,*b);b++;}
    return ans;
}
ll argmax(v_ll::iterator b,v_ll::iterator e){
    ll ans=0, cnt=0, val=*b;
    while (b<e) { if (val<*b) {ans=cnt; val=*b;} cnt++; b++;}
    return ans;
}
ll min(v_ll::iterator b,v_ll::iterator e){
    ll ans=*b;
    while (b<e) {ans=min(ans,*b);b++;}
    return ans;
}
ll argmin(v_ll::iterator b,v_ll::iterator e){
    ll ans=0, cnt=0, val=*b;
    while (b<e) { if (val>*b) {ans=cnt; val=*b;} cnt++; b++;}
    return ans;
}
ll sum(v_ll::iterator b,v_ll::iterator e){
    ll ans=0;
    while (b<e) {ans+=*b;b++;}
    return ans;
}

template<class T> bool chmax(T& x,const T& y){ if (x>=y) return false; x=y; return true;}
template<class T> bool chmin(T& x,const T& y){ if (x<=y) return false; x=y; return true;}

template<class T> void quit(T x){cout << x << endl; exit(0);}
void yesno(bool x){cout << (x?"Yes":"No") <<endl;}

ll roundup(ll x,ll y){return (x-1)/y+1;}
ll rem(ll x,ll y){ ll z=x%y; return z>=0?z:z+y; }

//setprecision(digit)
//sort(##.begin(),##.end(),[&](auto &x, auto &y){if (x<y) return true;})

struct dat{
    ll cost,n;
    dat(ll cost,ll n):cost(cost),n(n){}
    bool operator >(const dat& rhs)const {
        return cost>rhs.cost;
    }
};

int main(){
    ll T;
    cin >> T;
    for (ll i=0;i<T;i++){
        ll N,A,B,C,D;
        cin >> N >> A >> B >> C >> D;
        map<ll,ll> memo;
        priority_queue<dat,vector<dat>,greater<dat>> q;
        q.push(dat(0,N));
        while(!q.empty()){
            dat now=q.top();q.pop();
            if (memo[now.n]<now.cost) continue;
            if (now.n<1000000000000000000LL/D){
                ll cost=memo[now.n]+now.n*D;
                if(memo[0]==0||memo[0]>cost)memo[0]=cost;
            }
            {
                ll nx=now.n/5;
                ll cost=memo[now.n]+C+(now.n-nx*5)*D;
                if (nx<now.n){
                    if (memo[nx]==0||memo[nx]>cost){
                        memo[nx]=cost;
                        q.push(dat(cost,nx));
                    }
                }
            }
            {
                ll nx=(now.n-1)/5+1;
                ll cost=memo[now.n]+C+(nx*5-now.n)*D;
                if (nx<now.n){
                    if (memo[nx]==0||memo[nx]>cost){
                        memo[nx]=cost;
                        q.push(dat(cost,nx));
                    }
                }
            }
            {
                ll nx=now.n/3;
                ll cost=memo[now.n]+B+(now.n-nx*3)*D;
                if (nx<now.n){
                    if (memo[nx]==0||memo[nx]>cost){
                        memo[nx]=cost;
                        q.push(dat(cost,nx));
                    }
                }
            }
            {
                ll nx=(now.n-1)/3+1;
                ll cost=memo[now.n]+B+(nx*3-now.n)*D;
                if (nx<now.n){
                    if (memo[nx]==0||memo[nx]>cost){
                        memo[nx]=cost;
                        q.push(dat(cost,nx));
                    }
                }
            }
            {
                ll nx=now.n/2;
                ll cost=memo[now.n]+A+(now.n-nx*2)*D;
                if (nx<now.n){
                    if (memo[nx]==0||memo[nx]>cost){
                        memo[nx]=cost;
                        q.push(dat(cost,nx));
                    }
                }
            }
            {
                ll nx=(now.n-1)/2+1;
                ll cost=memo[now.n]+A+(nx*2-now.n)*D;
                if (nx<now.n){
                    if (memo[nx]==0||memo[nx]>cost){
                        memo[nx]=cost;
                        q.push(dat(cost,nx));
                    }
                }
            }
        }
        cout << memo[0] << endl;
    }
}


Measured memory_bytes: 4156