#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

// edit

struct Solve{
    ll N, A, B, C, D;
    
    map<ll, ll> dp;
    
    ll rec(ll n){
        if(n == 0) return 0;
        if(n == 1) return D;
        if(dp.count(n)) return dp[n];
        
        ll ret = LINF;
        if(1. * N * D < 1.1e18){
            chmin(ret, n * D);
        }
        
        {
            ll tmp = rec((n - n % 2) / 2) + A + (n % 2) * D;
            chmin(ret, tmp);
        }
        if(n % 2 != 0 && n > 2){
            ll tmp = rec((n - n % 2) / 2 + 1) + A + (n % 2) * D;
            chmin(ret, tmp);
        }
        
        {
            ll tmp = rec((n - n % 3) / 3) + B + (n % 3) * D;
            chmin(ret, tmp);
        }
        
        if(n % 3 != 0 && n > 3){
            ll tmp = rec((n - n % 3) / 3 + 1) + B + (3 - n % 3) * D;
            chmin(ret, tmp);
        }
        
        {
            ll tmp = rec((n - n % 5) / 5) + C + (n % 5) * D;
            chmin(ret, tmp);
        }

        if(n % 5 != 0 && n > 5){
            ll tmp = rec((n - n % 5) / 5 + 1) + C + (5 - n % 5) * D;
            chmin(ret, tmp);
        }
        
        return dp[n] = ret;
    }

    
    void solve() {
        cin >> N >> A >> B >> C >> D;
        
        ll ans = rec(N);
        
        cout << ans << endl;

        
        
    }
    
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    int T;
    cin >> T;
    REP(i, T) Solve().solve();
    


    return 0;
}


Measured memory_bytes: 3980