#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) {
    if (a > b) a = b;
}
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) {
    if (a < b) a = b;
}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
ll MOD = 1e9 + 7;
constexpr int MAX = 300030;
const double pi = acos(-1);
// constexpr double EPS = 1e-10;
ll LINF = 1e18;

ll N, A, B, C, D;
map<int, int> mp;
int cost2(int n) {
    int nxt = n / 2;
    int d = n - nxt;
    int c = A;
    if (d <= 2e9) {
        chmin(c, d * D);
    }
    return c;
}
int cost3(int n) {
    int nxt = n / 3;
    int d = n - nxt;
    int c = B;
    if (d <= 2e9) {
        chmin(c, d * D);
    }
    return c;
}
int cost5(int n) {
    int nxt = n / 5;
    int d = n - nxt;
    int c = C;
    if (d <= 2e9) {
        chmin(c, d * D);
    }
    return c;
}
int calc(ll N) {
    // print(N);
    if (N == 0) return 0;
    if (N == 1) return D;
    ll res = 1e18;
    if (mp.count(N)) return mp[N];
    int r2 = N % 2;
    chmin(res, r2 * D + cost2(N - r2) + calc(N / 2));
    if (r2) {
        chmin(res, (2 - r2) * D + cost2(N + 2 - r2) + calc((N + 1) / 2));
    }
    int r3 = N % 3;
    chmin(res, r3 * D + cost3(N - r3) + calc(N / 3));
    if (r3) {
        chmin(res, (3 - r3) * D + cost3(N + 3 - r3) + calc((N + 2) / 3));
    }
    int r5 = N % 5;
    chmin(res, r5 * D + cost5(N - r5) + calc(N / 5));
    if (r5) {
        chmin(res, (5 - r5) * D + cost5(N + 5 - r5) + calc((N + 4) / 5));
    }
    // pe(N); print(res);
    return mp[N] = res;
}
void solve() {
    cin >> N >> A >> B >> C >> D;
    mp.clear();
    print(calc(N));
}
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    while (q--) solve();
}


Measured memory_bytes: 4416