#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); }
template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

// snippet:sieve {{{
struct Sieve {/*{{{*/
    // エラトステネスのふるい O(NloglogN)
    int n;                              // n
    vector<int> f;                      // [1, 2, 3, 2, 5, 2, 7, 2, 3, ....]
    vector<int> primes;                 // [2, 3, 5, .......]
    Sieve(int n = 1) : n(n), f(n + 1) { /*{{{*/
        f[0] = f[1] = -1;
        for (ll i = 2; i <= n; ++i) {
            if (f[i]) continue;
            primes.push_back(i);
            f[i] = i;
            for (ll j = i * i; j <= n; j += i) {
                if (!f[j]) f[j] = i;
            }
        }
    } /*}}}*/
    bool is_prime(int x) { return f[x] == x; }

    vector<int> factor_list(int x) { /*{{{*/
        // n**2くらいまでは計算できるはず
        vector<int> res;
        if (x < n) {
            while (x != 1) {
                res.push_back(f[x]);
                x /= f[x];
            }
        }
        else {
            for (int i = 0; primes[i] * primes[i] <= x; i++) {
                while (x % primes[i] == 0) {
                    res.pb(primes[i]);
                    x /= primes[i];
                }
            }
            if (x != 1) res.pb(x);
        }

        return res;  // [2, 3, 3, 5, 5, 5.....]
    }                /*}}}*/

    vector<pair<int, int>> factor(int x) { /*{{{*/
        vector<int> fl = factor_list(x);
        if (fl.size() == 0) return {};
        vector<pair<int, int>> res(1, mp(fl[0], 0));
        for (int p : fl) {
            if (res.back().first == p) {
                res.back().second++;
            } else {
                res.emplace_back(p, 1);
            }
        }
        return res;  // [(2,1), (3,2), (5,3), .....]
    }                /*}}}*/
};/*}}}*/
Sieve sv(1e6);
// How to use
// sv.primes      // 素数のリスト
// sv.factor(x);  // 素因数分解
// snippet:sieve }}}


ll query(){
    cerrendl;
    ll n,a,b,c,d;cin>>n>>a>>b>>c>>d;
    dump(n, a, b, c, d);

    PQ<pll> q;
    q.push(mp(0, n));

    map<ll, ll> mindist;
    mindist[n] = 0;
    while(!q.empty()){
        auto [cost, u] = q.top();q.pop();
        auto f = [&](ll u, ll addcost, ll p){
            if (u%p==0){
                ll v = u/p;
                ll cc;
                if ((u-v) <= addcost/d + 2){
                    cc = cost+min(addcost, d*(u-v));
                }
                else{
                    cc = cost+addcost;
                }
                if (mindist.find(v)==mindist.end() || cc < mindist[v]){
                    q.push(mp(cc, v));
                    mindist[v] = cc;
                }
            }
            else{
                ll r = u%p;
                {
                    ll v = (u-r)/p;
                    ll cc;
                    if ((u-v) <= addcost/d + 2){
                        cc = cost+min(addcost, d*(u-v))+r*d;
                    }
                    else{
                        cc = cost+addcost+r*d;
                    }

                    if (mindist.find(v)==mindist.end() || cc < mindist[v]){
                        q.push(mp(cc, v));
                        mindist[v] = cc;
                    }
                }
                {
                    ll v = (u+(p-r))/p;
                    ll cc;
                    if ((u-v) <= addcost/d + 2){
                        cc = cost+min(addcost, d*(u-v))+(p-r)*d;
                    }
                    else{
                        cc = cost+addcost+(p-r)*d;
                    }
                    if (mindist.find(v)==mindist.end() || cc < mindist[v]){
                        q.push(mp(cc, v));
                        mindist[v] = cc;
                    }
                }
            }
        };
        // dump(u, cost);
        if (u==1){
            cout << cost + d << endl;
            return 0;
        }
        f(u, a, 2);
        f(u, b, 3);
        f(u, c, 5);

        if ((u-1) < 1e18/d + 10){
            ll cc = cost + (u-1)*d;
            if (mindist.find(1)==mindist.end() || cc < mindist[1]){
                q.push(mp(cc, 1));
                mindist[1] = cc;
            }
        }
    }

    return 0;
}

signed main(){/*{{{*/
    ll Q;cin>>Q;
    rep(_, Q){
        query();
    }
    check_input();
    return 0;
}/*}}}*/


Measured memory_bytes: 8088