#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#include <variant>

// Yay!!
#define endl codeforces

// macros for iterator
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

// alias
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

// variadic min/max
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }

// variadic chmin/chmax
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

// multi demension array
template <typename T, std::size_t Head, std::size_t... Tail> struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

// fill container
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { if constexpr (std::is_invocable<F, Args...>::value) { t = f(args...); } else { for (ssize_t i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); } }

// make multi dimension vector
template <typename T> vec<T> make_v(ssize_t sz) { return vec<T>(sz); }
template <typename T, typename... Tail> auto make_v(ssize_t hs, Tail&&... ts) { auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); return vec<decltype(v)>(hs, v); }

// init
namespace init__ { 
struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; 
}


ll solve() {
    ll n, a, b, c, d;
    std::cin >> n >> a >> b >> c >> d;
    std::map<ll, ll> costs;
    std::priority_queue<pll, vec<pll>, std::greater<pll>> pq;

    auto update = [&](ll s, ll t) {
        auto ite = costs.find(s);
        if (ite != costs.end() && ite->second <= t) return;
        costs[s] = t;
        pq.emplace(t, s);
    };
    
    auto is_overflow_t = [](ll a, ll b) {
        return !(a <= std::numeric_limits<ll>::max() - b);
    };

    auto is_overflow_m = [](ll a, ll b) {
        return !(a <= std::numeric_limits<ll>::max() / b);
    };

    update(n, 0);
    while (pq.size()) {
        auto [ cd, cur ] = pq.top();
        pq.pop();
        if (cur == 0) break;
        if (costs[cur] < cd) continue;
        if (!is_overflow_m(d, cur) && !is_overflow_t(cd, d * cur)) update(0, cd + d * cur);
        ll dl[] = { 2, 3, 5, };
        ll cl[] = { a, b, c, };
        for (ll i = 0; i < 3; i++) {
            ll m = cur % dl[i];
            if (!is_overflow_t(cd, m * d) && !is_overflow_t(cd + m * d, cl[i])) update((cur - m) / dl[i], cl[i] + m * d + cd);
            ll rm = (dl[i] - m) % dl[i];
            if (!is_overflow_t(cd, rm * d) && !is_overflow_t(cd + rm * d, cl[i])) update((cur + rm) / dl[i], cl[i] + rm * d + cd);
        }
    }

    return costs[0];
}

int main() {
    ll t;
    std::cin >> t;
    while (t--) std::cout << solve() << "\n";
    return 0;
}


Measured memory_bytes: 4456