#include <bits/stdc++.h>
using namespace std;
using LL = long long int;
#define incID(i, l, r) for(int i = (l)    ; i <  (r); ++i)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); ++i)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define dec(i, n)  decID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define FI first
#define SE second
#define FR front()
#define BA back()
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
auto setmin   = [](auto & a, auto b) { return (b <  a ? a = b, true : false); };
auto setmax   = [](auto & a, auto b) { return (b >  a ? a = b, true : false); };
auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };
auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };
#define SI(v) static_cast<int>(v.size())
#define RF(e, v) for(auto & e: v)
#define until(e) while(! (e))
#define if_not(e) if(! (e))
#define ef else if
#define UR assert(false)
#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);
void IN_() { };
template<typename T, typename ... U> void IN_(T &  a, U &  ... b) { cin >> a; IN_(b ...); };
template<typename T                > void OUT(T && a            ) { cout << a << endl; }
template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }

// ---- ----

template<typename T> class opt {
private:
	bool f;
	T v;
public:
	opt() { f = false; }
	opt(T v) : v(v) { f = true; }
	void reset() { f = false; }
	bool setmin  (T a) { return (! f || a <  v ? v = a, f = true : false); }
	bool setmax  (T a) { return (! f || a >  v ? v = a, f = true : false); }
	bool setmineq(T a) { return (! f || a <= v ? v = a, f = true : false); }
	bool setmaxeq(T a) { return (! f || a >= v ? v = a, f = true : false); }
	bool has_val() { return f; }
	bool is_null() { return ! f; }
	T & val() { assert(f); return v; }
	friend T operator||(opt a, T e) { return (a.f ? a.v : e); }
	friend istream & operator>>(istream & s, opt<T> & a) { a.f = true; return (s >> a.v); }
	friend ostream & operator<<(ostream & s, opt<T>   a) { return (a.f ? s << a.v : s << "[null]"); }
};

template<typename T> using LPQ = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using GPQ = priority_queue<T, vector<T>,    less<T>>;

int main() {
	auto prod = [](LL x, LL y) -> LL {
		LL INF = 1e12;
		return (1.0 * x * y < INF ? x * y : INF);
	};
	
	IN(int, t);
	inc(tt, t) {
		IN(LL, n, a, b, c, d);
		LPQ<pair<LL, LL>> q;
		map<LL, opt<LL>> mp;
		auto add = [&](LL s, LL v) {
			if(mp[v].setmin(s)) { q.emplace(s, v); }
		};
		add(0, n);
		until(q.empty()) {
			auto [s, v] = q.top(); q.pop();
			auto f = [&](LL m, LL k) {
				add(s + prod(v - v / m, d) , v / m    );
				add(s + (    v % m) * d + k, v / m    );
				add(s + (m - v % m) * d + k, v / m + 1);
			};
			f(2, a);
			f(3, b);
			f(5, c);
		}
		OUT(mp[0].val());
	}
}


Measured memory_bytes: 5100