#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右下左上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, 1, 0, -1, -1, 1, 1, -1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t szi, szj;
        inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
    };
    inp inp1;

    ll dfs(ll n, map<ll, ll>& mp, ll a, ll b, ll c, ll d) {
        if (n == 0) return 0LL;
        if (mp.find(n) != mp.end()) return mp[n];
        if (mp.find(n) != mp.end()) return mp[n];
        ll ret = infll;

        // Dだけで済ます
        if (n <= infll / d) ret = n * d;

        for (int i = -4; i <= 4; ++i) {
            ll x = n + i;
            if (x <= 0) continue;
            if (x % 5 == 0 && x / 5 < n) chmin(ret, dfs(x / 5, mp, a, b, c, d) + c + d * abs(i));
            if (abs(i) >= 3) continue;
            if (x % 3 == 0 && x / 3 < n) chmin(ret, dfs(x / 3, mp, a, b, c, d) + b + d * abs(i));
            if (abs(i) >= 2) continue;
            if (x % 2 == 0 && x / 2 < n) chmin(ret, dfs(x / 2, mp, a, b, c, d) + a + d * abs(i));
        }

        return mp[n] = ret;
    }
}

int main() {

    int t = inp1;
    vector<ll> ans(t, -1LL);

    rep(i, t) {
        ll n, a, b, c, d;
        cin >> n >> a >> b >> c >> d;

        map<ll, ll> mp;
        ans[i] = dfs(n, mp, a, b, c, d);
    }

    for (auto q : ans) Cout(q);

    return 0;
}


Measured memory_bytes: 4352