#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline int rd_int(void){
  int x;
  rd(x);
  return x;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
long long N;
long long A;
long long B;
long long C;
long long D;
long long P[6];
int arr[3] = {2,3,5};
long long res;
int main(){
  int Lj4PdHRW;
  int KL2GvlyY = rd_int();
  for(Lj4PdHRW=(0);Lj4PdHRW<(KL2GvlyY);Lj4PdHRW++){
    priority_queue<pair<long long,long long>> q;
    set<long long> visited;
    long long n;
    long long c;
    long long m;
    rd(N);
    rd(A);
    rd(B);
    rd(C);
    rd(D);
    P[2] = A;
    P[3] = B;
    P[5] = C;
    res = 4611686016279904256LL;
    q.push( make_pair(0LL, N) );
    while(q.size()){
      int FmcKpFmN;
      n = q.top().second;
      c = -q.top().first;
      q.pop();
      if(visited.count(n)){
        continue;
      }
      visited.insert(n);
      if(c >= res){
        continue;
      }
      if(c + (double)n*D < 2*4611686016279904256LL){
        chmin(res, c + n*D);
      }
      if(n==1){
        continue;
      }
      for(FmcKpFmN=(0);FmcKpFmN<(3);FmcKpFmN++){
        auto &i = arr[FmcKpFmN];
        m = n % i;
        q.push( make_pair(-(c+P[i]+m*D), n/i) );
        if(m){
          q.push( make_pair(-(c+P[i]+(i-m)*D), (n+(i-m))/i) );
        }
      }
    }
    wt_L(res);
    wt_L('\n');
  }
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// ll N, A, B, C, D, P[6]; int arr[3] = {2,3,5};
// ll res;
// 
// {
//   REP(rd_int()){
//     priority_queue<pair<ll,ll>> q;
//     set<ll> visited;
//     ll n, c, m;
// 
//     rd(N,A,B,C,D);
//     P[2] = A;
//     P[3] = B;
//     P[5] = C;
//     res = ll_inf;
// 
//     q.push( make_pair(0LL, N) );
//     while(q.size()){
//       n = q.top().second;
//       c = -q.top().first;
//       q.pop();
//       if(visited.count(n)) continue;
//       visited.insert(n);
// 
// //      wt(n,c,(int)q.size(),res);
// 
//       if(c >= res) continue;
//       if(c + (double)n*D < 2*ll_inf) res <?= c + n*D;
//       if(n==1) continue;
// 
//       rep[arr](i,3){
//         m = n % i;
//         q.push( make_pair(-(c+P[i]+m*D), n/i) );
//         if(m) q.push( make_pair(-(c+P[i]+(i-m)*D), (n+(i-m))/i) );
//       }
//     }
// 
//     wt(res);
//   }
// }


Measured memory_bytes: 4216