#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int64, int64> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

ii handle1(int64 cur, int64 t, int64 c1, int64 c2, map<int64, int64>& d) {
  int64 r = t - cur % t;
  if (r == t) r = 0;
  int64 nxt = (cur + r) / t;
  int64 nxt_cost = d[cur] + r * c1 + c2;
  auto it = d.find(nxt);
  if (it == d.end() || it->second > nxt_cost) {
    d[nxt] = nxt_cost;
    return {nxt_cost, nxt};
  }
  return {-1, -1};
}

ii handle2(int64 cur, int64 t, int64 c1, int64 c2, map<int64, int64>& d) {
  int64 r = cur % t;
  int64 nxt = (cur - r) / t;
  int64 nxt_cost = d[cur] + r * c1 + c2;
  auto it = d.find(nxt);
  if (it == d.end() || it->second > nxt_cost) {
    d[nxt] = nxt_cost;
    return {nxt_cost, nxt};
  }
  return {-1, -1};
}

int main() {
  int cas;
  scanf("%d", &cas);
  while (cas--) {
    int64 n, a, b, c, d;
    scanf("%lld%lld%lld%lld%lld", &n, &a, &b, &c, &d);
    map<int64, int64> dp;
    dp[n] = 0;
    priority_queue<ii, vector<ii>, greater<ii>> Q;
    Q.push({dp[n], n});
    int64 best = 1LL << 60;
    while (!Q.empty()) {
      int64 dd = Q.top().first;
      int64 x = Q.top().second;
      Q.pop();
      if (dd != dp[x]) continue;
      best = min((__int128)best, (__int128)x * d + dd);
      // trace(x, dp[x], x * d + dd);
      ii nxt = handle1(x, 2, d, a, dp);
      if (nxt.first >= 0) Q.push(nxt);
      nxt = handle2(x, 2, d, a, dp);
      if (nxt.first >= 0) Q.push(nxt);
      nxt = handle1(x, 3, d, b, dp);
      if (nxt.first >= 0) Q.push(nxt);
      nxt = handle2(x, 3, d, b, dp);
      if (nxt.first >= 0) Q.push(nxt);
      nxt = handle1(x, 5, d, c, dp);
      if (nxt.first >= 0) Q.push(nxt);
      nxt = handle2(x, 5, d, c, dp);
      if (nxt.first >= 0) Q.push(nxt);
    }
    printf("%lld\n", best);
  }
  return 0;
}


Measured memory_bytes: 4160