#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define presum(p, a, n) {p[0] = a[0]; for (int i = 1; i < (n); i++) p[i] = a[i] + p[i-1];}
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
// mt19937 rng(61378913);
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
 


ll n, m, k, q, l, r, x, y, z;
// ll a[1000005];
// ll b[1000005];
// ll c[1000005];
string s, t;
ll ans = 0;

map<ll, ll> memo;
ll a, b, c, d;

ll lastt(ll v, ll d) {
  return (v / d) * d;
}

ll nextt(ll v, ll d) {
  return (v / d + 1) * d;
}

bool check(ll k, ll v) {
  return memo.find(k) == memo.end() || v < memo[k];
}

void solve(int tc) {
  cin >> n >> a >> b >> c >> d;

  memo.clear();
  set<pll> q;
  q.insert(mp(0, n));
  ans = 4 * mod * mod;
  while (!q.empty()) {
    pll x = *q.begin();
    q.erase(q.begin());

    if (!check(x.s, x.f)) continue;
    if (x.s < 0) continue;
    if (x.s == 0) {
      ans = min(ans, x.f);
      break;
    }
    // cout << x << endl;
    memo[x.s] = x.f;
    ll v = 0;
    if (x.s % 2 == 0) {
      if (check(x.s / 2, x.f + a))
        q.insert(mp(x.f + a, x.s / 2));
    } else {
      ll l = lastt(x.s, 2), r = nextt(x.s, 2);
      ll cl = x.f + a + d * abs(x.s - l);
      ll cr = x.f + a + d * abs(x.s - r);
      if (check(l, cl)) q.insert(mp(cl, l / 2));
      if (check(r, cr)) q.insert(mp(cr, r / 2));
    }
    if (x.s % 3 == 0) {
      if (check(x.s / 3, x.f + b))
        q.insert(mp(x.f + b, x.s / 3));
    } else {
      ll l = lastt(x.s, 3), r = nextt(x.s, 3);
      ll cl = x.f + b + d * abs(x.s - l);
      ll cr = x.f + b + d * abs(x.s - r);
      if (check(l, cl)) q.insert(mp(cl, l / 3));
      if (check(r, cr)) q.insert(mp(cr, r / 3));
    }
    if (x.s % 5 == 0) {
      if (check(x.s / 5, x.f + c))
        q.insert(mp(x.f + c, x.s / 5));
    } else {
      ll l = lastt(x.s, 5), r = nextt(x.s, 5);
      ll cl = x.f + c + d * abs(x.s - l);
      ll cr = x.f + c + d * abs(x.s - r);
      if (check(l, cl)) q.insert(mp(cl, l / 5));
      if (check(r, cr)) q.insert(mp(cr, r / 5));
    }
    if (d < 3e18 / x.s) ans = min(ans, x.f + d * x.s);
  }

  cout << ans << '\n';
}
 
int main() {
  send help
 
  // usaco("file");



  int tc = 1;
  cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
} 

Measured memory_bytes: 4804