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

// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;

/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()

/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto&& i : n)

/* debug */
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';

/* alias */
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
// using D = double;
// using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;

/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
// const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

/* func */
inline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}
inline int in() {int x; cin >> x; return x;}
inline ll IN() {ll x; cin >> x; return x;}
inline vs split(const string& t, char c) {vs v; stringstream s(t); string b; while(getline(s, b, c)) v.eb(b); return v;}
template <typename T> inline bool chmin(T& a, const T& b) {if (a > b) a = b; return a > b;}
template <typename T> inline bool chmax(T& a, const T& b) {if (a < b) a = b; return a < b;}
template <typename T, typename S> inline void print(const pair<T, S>& p) {cout << p.first << " " << p.second << endl;}
template <typename T> inline void print(const T& x) {cout << x << endl;}
template <typename T, typename S> inline void print(const vector<pair<T, S>>& v) {for (auto&& p : v) print(p);}
template <typename T> inline void print(const vector<T>& v, string s = " ") {REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");}
inline void yesno(bool ok, string yes = "Yes", string no = "No") {cout << (ok?yes:no) << endl;}


ll gmin;

void solve() {
    ll N, A, B, C, D; cin >> N >> A >> B >> C >> D;
    if (N == 1) {
        print(D);
        return;
    }
    // gmin = LINF;
    vi k = {2, 3, 5};
    PQ<ll> q;
    map<ll, ll> mp;
    ll p, prevp, np, curcost, ncost, deltacost;
    int mul;
    ll mulcost;
    q.push(N);
    mp[N] = 0;
    q.push(0);
    mp[0] = LINF;
    prevp = -1;
    while(!q.empty()) {
        p = q.top();
        curcost = mp[p];
        // cout << "got N:" << p << ", cost:" << curcost << endl;
        if (p == 0) {
            print(curcost);
            break;
        }
        if (p == prevp) continue;
        if ((LINF - curcost)/D>p) {
            mp[0] = min(mp[0], curcost + D*p);
        }
        REP(i, k.size()) {
            mul = k[i];
            if (mul == 2) mulcost = A;
            if (mul == 3) mulcost = B;
            if (mul == 5) mulcost = C;
            if (p % mul == 0) {
                np = p / mul;
                if (D < LINF/(np*(mul-1)) && np * (mul-1) * D < mulcost) {
                    ncost = curcost + np * (mul-1) * D;
                } else {
                    ncost = curcost + mulcost;
                }
                if(!mp[np]) {
                    mp[np] = ncost;
                    q.push(np);
                    // cout << "push(1):" << np << endl;
                } else if (mp[np] > ncost) {
                    mp[np] = ncost;
                }
            } else {
                // lower
                np = p - (p % mul);
                deltacost = (p % mul) * D;

                if (np > 0) {
                    np = np / mul;
                    if (D < LINF/(np*(mul-1)) && np * (mul-1) * D < mulcost) {
                        ncost = curcost + np * (mul-1) * D;
                    } else {
                        ncost = curcost + mulcost;
                    }
                    ncost += deltacost;
                    if(!mp[np]) {
                        mp[np] = ncost;
                        q.push(np);
                        // cout << "push(2):" << np << endl;
                    } else if (mp[np] > ncost) {
                        mp[np] = ncost;
                    }
                }


                // upper
                np = p + (mul - (p % mul));
                deltacost = (mul - (p % mul)) * D;

                np = np / mul;
                if (D < LINF/(np*(mul-1)) && np * (mul-1) * D < mulcost) {
                    ncost = curcost + np * (mul-1) * D;
                } else {
                    ncost = curcost + mulcost;
                }
                ncost += deltacost;
                if(!mp[np]) {
                    mp[np] = ncost;
                    q.push(np);
                    // cout << "push(3):" << np << endl;
                } else if (mp[np] > ncost) {
                    mp[np] = ncost;
                }
            }
        }
        prevp = p;
        q.pop();
    }
    // print(gmin);
}

signed main() {
    //my-code
    int T; cin >> T;
    REP(loop, T) {
        solve();
    }

    return 0;
}

// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々

Measured memory_bytes: 4468