#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

ll solve(ll N, ll A, ll B, ll C, ll D){
  priority_queue<pair<ll, ll>> que;
  que.push(make_pair(-0, N));
  set<ll> N_tmp_st;
  while(que.size()){
    pair<ll, ll> now = que.top(); que.pop();
    ll cost_tmp = -now.first;
    ll N_tmp = now.second;
    if(N_tmp_st.find(N_tmp)!=N_tmp_st.end()) continue;
    N_tmp_st.emplace(N_tmp);
    //debug_print(N_tmp, cost_tmp);

    if(cost_tmp<0) exit(0);

    if(N_tmp==1) return cost_tmp+D;
    if(N_tmp==0) return cost_tmp;

    {
      ll amari = N_tmp%2;
      if(amari==0){
        ll tmp_cost = min((N_tmp/2)*D, A);
        if(N_tmp/2>A/D){
          tmp_cost = A;
        }
        que.push(make_pair(-cost_tmp-tmp_cost, N_tmp/2));
      }else{
        ll N_tmp_tmp1 = N_tmp+1;
        ll tmp_cost1 = min((N_tmp_tmp1/2)*D, A)+D;
        if(N_tmp_tmp1/2>A/D){
          tmp_cost1 = A+D;
        }
        que.push(make_pair(-cost_tmp-tmp_cost1, N_tmp_tmp1/2));

        ll N_tmp_tmp2 = N_tmp-1;
        if(N_tmp_tmp2<0) continue;
        ll tmp_cost2 = min((N_tmp_tmp2/2)*D, A)+D;
        if(N_tmp_tmp2/2>A/D){
          tmp_cost2 = A+D;
        }
        que.push(make_pair(-cost_tmp-tmp_cost2, N_tmp_tmp2/2));
      }
    }

    {
      ll amari = N_tmp%3;
      if(amari==0){
        ll tmp_cost = min((N_tmp/3*2)*D, B);
        if(N_tmp/3>B/D){
          tmp_cost = B;
        }
        que.push(make_pair(-cost_tmp-tmp_cost, N_tmp/3));
      }else{
        ll N_tmp_tmp1 = N_tmp+(3-amari);
        ll tmp_cost1 = min((N_tmp_tmp1/3*2)*D, B)+D*(3-amari);
        if(N_tmp_tmp1/3>B/D){
          tmp_cost1 = B+D*(3-amari);
        }
        que.push(make_pair(-cost_tmp-tmp_cost1, N_tmp_tmp1/3));

        ll N_tmp_tmp2 = N_tmp-amari;
        if(N_tmp_tmp2<0) continue;
        ll tmp_cost2 = min((N_tmp_tmp2/3*2)*D, B)+D*amari;
        if(N_tmp_tmp2/3>B/D){
          tmp_cost2 = B+D*amari;
        }
        que.push(make_pair(-cost_tmp-tmp_cost2, N_tmp_tmp2/3));
      }
    }

    {
      ll amari = N_tmp%5;
      if(amari==0){
        ll tmp_cost = min((N_tmp/5*4)*D, C);
        if(N_tmp/5>C/D){
          tmp_cost = C;
        }
        que.push(make_pair(-cost_tmp-tmp_cost, N_tmp/5));
      }else{
        ll N_tmp_tmp1 = N_tmp+(5-amari);
        ll tmp_cost1 = min((N_tmp_tmp1/5*4)*D, C)+D*(5-amari);
        if(N_tmp_tmp1/5>C/D){
          tmp_cost1 = C+D*(5-amari);
        }
        que.push(make_pair(-cost_tmp-tmp_cost1, N_tmp_tmp1/5));

        ll N_tmp_tmp2 = N_tmp-amari;
        if(N_tmp_tmp2<0) continue;
        ll tmp_cost2 = min((N_tmp_tmp2/5*4)*D, C)+D*amari;
        if(N_tmp_tmp2/5>C/D){
          tmp_cost2 = C+D*amari;
        }
        que.push(make_pair(-cost_tmp-tmp_cost2, N_tmp_tmp2/5));
      }
    }

    /*
    if(N_tmp%2==0){
      que.push(make_pair(-cost_tmp-A, N_tmp/2));
    }
    if(N_tmp%3==0){
      que.push(make_pair(-cost_tmp-B, N_tmp/3));
    }
    if(N_tmp%5==0){
      que.push(make_pair(-cost_tmp-C, N_tmp/5));
    }
    que.push(make_pair(-cost_tmp-D, N_tmp+1));
    que.push(make_pair(-cost_tmp-D, N_tmp-1));
    */
  }
  return -1;
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll T;
  IN(T);

  REP(t,T){
    ll N, A, B, C, D;
    IN(N,A,B,C,D);
    OUT(solve(N,A,B,C,D));
  }

  return 0;
}

Measured memory_bytes: 4112