#include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>
#include <queue>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
	#define DEBUG_OUTPUT_ENABLED 1
	#define DBG(X) dout << #X << "=" << (X) << '\n';
	#define SAY(X) dout << (X) << '\n';
#else
	#define DEBUG_OUTPUT_ENABLED 0
	#define DBG(X) 42;
	#define SAY(X) 42;
#endif

#define dout   ___debug::instance

using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const set<T>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const multiset<T>& v) { for(auto el: v) cout << el << " "; return os; }
namespace ___debug {
	struct DebugStream {
		private:
			bool is_first;
		public:
			DebugStream(bool _is_first): is_first(_is_first) {}
			template<typename T> DebugStream operator<<(const T& value) const {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				cout << value;
				return DebugStream(false);
			};

			template<typename T> DebugStream printArray(T* l, T* r) {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				while(l != r) {
					cout << (*l);
					++l;
					if(l == r) {
						cout << '\n';
					} else {
						cout << ' ';
					}
				}
				return DebugStream(false);
			}
	};
	DebugStream instance(true);
};

const int INT_INF = (int)(2e9);
const ll  LL_INF  = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for(auto& elem: ret) cin >> elem; return ret; }
template<typename T> inline void makeUnique(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }

struct Task {
	map<ll, ll> MEM;
	ll N, A, B, C, D;
	ll calc(ll);
	ll get(ll);
	void solve() {
		cin >> N >> A >> B >> C >> D;
		cout << get(N) << '\n';
	}
};

ll Task::calc(ll x) {
	ll rez = LL_INF;
	if(x <= LL_INF / D) {
		rez = min(rez, x * D);
	}
	ll r2 = x & 1LL;
	if((x - r2) / 2 < x) {
		rez = min(rez, r2 * D + A + get((x - r2) / 2));
	}
	if((x + 2 - r2) / 2 < x) {
		rez = min(rez, (2 - r2) * D + A + get((x + 2 - r2) / 2));
	}
	ll r3 = x % 3;
	if((x - r3) / 3 < x) {
		rez = min(rez, r3 * D + B + get((x - r3) / 3));
	}
	if((x + 3 - r3) / 3 < x) {
		rez = min(rez, (3 - r3) * D + B + get((x + 3 - r3) / 3));
	}
	ll r5 = x % 5;
	if((x - r5) / 5 < x) {
		rez = min(rez, r5 * D + C + get((x - r5) / 5));
	}
	if((x + 5 - r5) / 5 < x) {
		rez = min(rez, (5 - r5) * D + C + get((x + 5 - r5) / 5));
	}
	return rez;
}

ll Task::get(ll x) {
	if(MEM.count(x)) {
		return MEM[x];
	} else {
		return (MEM[x] = calc(x));
	}
}

int main() {
	fast_io();
	int T = fetch<int>();
	for(int it = 1; it <= T; ++it) {
		Task task;
		task.solve();
	}

	return 0;
}


Measured memory_bytes: 4744