// #pragma GCC optimize("Ofast") // optimise speed over memory
// #pragma GCC optimize ("unroll-loops") // remove this if loop bodies are heavy
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
  return '"' + s + '"';
}
string to_string(const char* s) {
  return to_string((string) s);
}
string to_string(bool b) {
  return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
 
#define ll long long
const long long mod = 1e9+7; // CHECK
long long power(long long a, long long b, long long m = mod) {
    if(b < 0) {
        return power(power(a, -b), mod-2);
    }
    long long x = 1;
    while(b) {
        if(b & 1) {
            x = 1ll * x * a % m;
        }
        a = 1ll * a * a % m;
        b /= 2;
    }
    return x;
}
const int INT_INF = 1e9+9;
const ll LL_INF = 2e18;
const int N = 3e5+9;
ll add_lim(ll x, ll y) {
    return min(LL_INF, x + y);
}
ll mul_lim(ll x, ll y) {
    if(x == 0) return 0;
    if (LL_INF / x < y) return LL_INF;
    return min(LL_INF, x * y);
}
const ll nums[3] = {2,3,5};
ll c[3], d;
map<ll, ll> dp;
ll solve(ll n) {
    if(n < 0) return LL_INF;
    if(n == 0) return 0;
    if(dp.count(n)) return dp[n];
    ll &ret = dp[n];
    ret = LL_INF;
    for(int i = 0; i < 3; i++) {
        ll k = nums[i];
        ret = min(ret, add_lim(solve(n/k), mul_lim(n-n/k, d)));
        ll t = (n+k-1) / k;
        ret = min(ret, add_lim(solve(t), mul_lim(n-t, d)));
        ll u = add_lim(mul_lim(n - n/k * k, d), c[i]);
        ret = min(ret, add_lim(solve(n / k), u));
        u = add_lim(mul_lim(t * k - n, d), c[i]);
        ret = min(ret, add_lim(solve(t), u));
    }
    return ret;
}
signed main() {  
    ios_base::sync_with_stdio(false); 
    #ifndef LOCAL
    cin.tie(0); cout.tie(0);
    #endif
    

    int tt; cin >> tt;
    while(tt--) {
        ll n; cin >> n >> c[0] >> c[1] >> c[2] >> d;
        dp.clear();
        cout << solve(n) << '\n';
        // debug(dp);

    }

    
    
    






    return 0;
    
}


Measured memory_bytes: 4436