#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
const signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

//=============================================================================================

auto solve(ll n, ll a, ll b, ll c, ll d) {
	ll ans = 1e18;
	unordered_map<ll, ll> use;
	priority_queue<PAIR, V<PAIR>, std::greater<PAIR>> q;

	auto ad = [&](ll cst, ll x) {
		if (use.find(x) == use.end()) {
			q.emplace(cst, x);
			use.emplace(x, cst);
			return;
		}
		if (cst < use[x]) {
			q.emplace(cst, x);
			use[x] = cst;
		}
	};

	q.emplace(0, n);
	while (!q.empty()) {
		auto [cst, x] = q.top();
		q.pop();
		if (cst > use[x]) { continue; }
		if (x == 0) { chmin(ans, cst); continue; }
		if (1e18 / x > d - 10) { chmin(ans, cst + x * d); }
		//cout << x << " " << cst << endl;
		if (x & 1) {
			ad(cst + a + d, (x - 1) / 2);
			ad(cst + a + d, (x + 1) / 2);
		} else {
			ad(cst + a, x / 2);
		}

		ll d3 = x % 3;
		if (d3 > 1) {
			ll nd3 = 3 - d3;
			ad(cst + b + nd3 * d, (x + nd3) / 3);
		} else {
			ad(cst + b + d3 * d, (x - d3) / 3);
		}

		ll d5 = x % 5;
		if (d5 > 2) {
			ll nd5 = 5 - d5;
			ad(cst + c + nd5 * d, (x + nd5) / 5);
		} else {
			ad(cst + c + d5 * d, (x - d5) / 5);
		}
	}
	return ans;
}

auto solve_old(ll n, ll a, ll b, ll c, ll d) {
	ll ans = 1e18;
	unordered_map<ll, ll> use;
	priority_queue<PAIR, V<PAIR>, std::greater<PAIR>> q;

	auto ad = [&](ll cst, ll x) {
		if (use.find(x) == use.end()) {
			q.emplace(cst, x);
			use.emplace(x, cst);
			return;
		}
		if (cst < use[x]) {
			q.emplace(cst, x);
			use[x] = cst;
		}
	};

	q.emplace(0, n);
	while (!q.empty()) {
		auto [cst, x] = q.top();
		q.pop();
		if (cst > use[x]) { continue; }
		if (x == 0) { chmin(ans, cst); continue; }
		if (1e18 / x > d - 10) { chmin(ans, cst + x * d); }
		//cout << x << " " << cst << endl;
		if (x & 1) {
			ad(cst + a + d, (x - 1) / 2);
		} else {
			ad(cst + a, x / 2);
		}

		ll d3 = x % 3;
		if (d3 > 1) {
			ll nd3 = 3 - d3;
			ad(cst + b + nd3 * d, (x + nd3) / 3);
		} else {
			ad(cst + b + d3 * d, (x - d3) / 3);
		}

		ll d5 = x % 5;
		if (d5 > 2) {
			ll nd5 = 5 - d5;
			ad(cst + c + nd5 * d, (x + nd5) / 5);
		} else {
			ad(cst + c + d5 * d, (x - d5) / 5);
		}
	}
	return ans;
}
signed main() {
	/**/
	ll t;
	cin >> t;
	REP(_, t) {
		ll n, a, b, c, d;
		cin >> n >> a >> b >> c >> d;

		auto ans = solve(n, a, b, c, d);
		cout << ans << endl;
	}
	/*/
	auto gen = Sample::SampleGenerator(0);

	REP(_, 100) {
		auto [n, a, b, c, d] = gen.generate(
			PAIR{1e2,1e15},
			PAIR{1e1,1e5},
			PAIR{1e1,1e5},
			PAIR{1e1,1e5},
			PAIR{1e1,1e5}
		);

		auto ans = solve(n, a, b, c, d);
		auto ans_o = solve_old(n, a, b, c, d);

		if (ans != ans_o) {
			cout << n << " "
				<< a << " "
				<< b << " "
				<< c << " "
				<< d << endl;
			dump(ans, ans_o);
			break;
		}
	}
	/**/
}

Measured memory_bytes: 4236