#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const long double eps=1e-60;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
ll digit(ll n){
    ll ans=0;
    while(n){
        n/=10;ans++;
    }
    return ans;
}
int main(){
    ll q;cin>>q;
    rep(tt,q){
        ll n,a,b,c,d;cin>>n>>a>>b>>c>>d;
        map<ll,ll> mp;
        SPQ(P) pq;
        mp[n]=0;
        pq.push(P(0,n));
        while(true){
            auto t=pq.top();
            pq.pop();
            if(t.fi!=mp[t.se])continue;
            ll x=t.se;
            //outp(t);
            if(x==1){
                out(t.fi+d);
                break;
            }
                ll nc=a+(x%2)*d;
                if(digit(x-x/2)+digit(d)<=15)chmin(nc,d*(x-x/2));
                nc+=t.fi;
                if(mp.count(x/2)){
                    if(chmin(mp[x/2],nc))pq.push(P(nc,x/2));
                }
                else{
                    mp[x/2]=nc;pq.push(P(nc,x/2));
                }
                nc=b+(x%3)*d;
                if(digit(x-x/3)+digit(d)<=15)chmin(nc,d*(x-x/3));
                nc+=t.fi;
                if(mp.count(x/3)){
                    if(chmin(mp[x/3],nc))pq.push(P(nc,x/3));
                }
                else{
                    mp[x/3]=nc;pq.push(P(nc,x/3));
                }
                nc=c+(x%5)*d;
                if(digit(x-x/5)+digit(d)<=15)chmin(nc,d*(x-x/5));
                nc+=t.fi;
                if(mp.count(x/5)){
                    if(chmin(mp[x/5],nc))pq.push(P(nc,x/5));
                }
                else{
                    mp[x/5]=nc;pq.push(P(nc,x/5));
                }

                /////

                ll nk;
                nk=(x+1)/2;
                nc=a+(2-x%2)%2*d;
                if(digit(x-nk)+digit(d)<=15)chmin(nc,(x-nk)*d);
                nc+=t.fi;
                if(mp.count(nk)){
                    if(chmin(mp[nk],nc))pq.push(P(nc,nk));
                }
                else{
                    mp[nk]=nc;pq.push(P(nc,nk));
                }
                nk=(x+2)/3;
                nc=b+(3-x%3)%3*d;
                if(digit(x-nk)+digit(d)<=15)chmin(nc,(x-nk)*d);
                nc+=t.fi;
                if(mp.count(nk)){
                    if(chmin(mp[nk],nc))pq.push(P(nc,nk));
                }
                else{
                    mp[nk]=nc;pq.push(P(nc,nk));
                }
                nk=(x+4)/5;
                nc=c+(5-x%5)%5*d;
                if(digit(x-nk)+digit(d)<=15)chmin(nc,(x-nk)*d);
                nc+=t.fi;
                if(mp.count(nk)){
                    if(chmin(mp[nk],nc))pq.push(P(nc,nk));
                }
                else{
                    mp[nk]=nc;pq.push(P(nc,nk));
                }
        }
    }
}

Measured memory_bytes: 4272