#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;


unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}
void dfs() {

}

int main() {
    ll t;
    cin >> t;
    for (int idf = 0; idf < t; idf++) {
        ll x, a, b, c, d;
        cin >> x >> a >> b >> c >> d;
        priority_queue<ll> q;
        map<ll, ll> mp;
        q.push(x);
        mp[x] = 0;
        ll ans = 1234567891234567890;
        while (!q.empty()) {
            ll n = q.top();
            ll u = mp[n];
            if (n < (100000000000000-u)/d)ans = min(u + n * d, ans);
            if (n % 2 == 0) {
                if (!mp.count(n / 2)) {
                    q.push(n / 2);
                    mp[n / 2] = u + a;
                }
                else {
                    mp[n / 2] = min(mp[n / 2], u + a);
                }
            }
            else {
                if (!mp.count(n / 2)) {
                    q.push(n / 2);
                    mp[n / 2] = u + a+d;
                }
                else {
                    mp[n / 2] = min(mp[n / 2], u + a+d);
                }
                if (!mp.count(n / 2+1)) {
                    q.push(n / 2+1);
                    mp[n / 2+1] = u + a+d;
                }
                else {
                    mp[n / 2+1] = min(mp[n / 2+1], u + a + d);
                }
            }
            if (n % 3 == 0) {
                if (!mp.count(n / 3)) {
                    q.push(n / 3);
                    mp[n / 3] = u + b;
                }
                else {
                    mp[n / 3] = min(mp[n / 3], u + b);
                }
            }
            else {
                if (!mp.count(n / 3)) {
                    q.push(n / 3);
                    mp[n / 3] = u + b + d * (n % 3);
                }
                else {
                    mp[n / 3] = min(mp[n / 3], u + b + d * (n % 3));
                }
                if (!mp.count(n / 3+1)) {
                    q.push(n / 3+1);
                    mp[n / 3+1] = u + b + d * (3-n % 3);
                }
                else {
                    mp[n / 3+1] = min(mp[n / 3+1], u + b + d * (3-n % 3));
                }
            }
            if (n % 5 == 0) {
                if (!mp.count(n / 5)) {
                    q.push(n / 5);
                    mp[n / 5] = u + c;
                }
                else {
                    mp[n / 5] = min(mp[n / 5], u + c);
                }
            }
            else {
                if (!mp.count(n / 5)) {
                    q.push(n / 5);
                    mp[n / 5] = u + c + d * (n % 5);
                }
                else {
                    mp[n / 5] = min(mp[n / 5], u + c + d * (n % 5));
                }
                if (!mp.count(n / 5+1)) {
                    q.push(n / 5+1);
                    mp[n / 5+1] = u + c + d * (5 - n % 5);
                }
                else {
                    mp[n / 5+1] = min(mp[n / 5+1], u + c + d * (5-n % 5));
                }
            }
            q.pop();
        }
        cout << ans << endl;
    }
}

Measured memory_bytes: 4296