#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <string>

#include <cmath>
#include <queue>
#include <stack>

using namespace std;

#define LL long long

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};

LL mod(LL x, LL md) {
	return ((x % md) + md) % md;
}

class Mint {
public:
	static LL md;
	LL x;
	Mint(LL _x = 0) {
		x = mod(_x, md);
	}
	Mint(const Mint &y) {
		x = mod(y.x, md);
	}
};

void MintMyExgcd(LL a, LL b, LL &x, LL &y) {
	// solve equation ax + by = 1 (mod m)
	LL md = Mint::md;
	if (b == 0) {
		y = 0;
		x = 1;
		return ;
	}
	MintMyExgcd(b, a % b, x, y);
	LL t = y;
	y = mod(x - (a / b) * y, md);
	x = t;
}

LL MintNY(LL x) {
	if (x == 0) {
		return 1;
	}
	LL md = Mint::md;
	LL a, b;
	MintMyExgcd(x, md, a, b);
	while (a < 0) {
		a += md;
	}
	return a;
}

/* LL gcd(LL a, LL b) {
	if (b == 0) {
		return a;
	}
	return gcd(b, a % b);
} */

Mint operator+(Mint a, Mint b) {
	return Mint(mod(a.x + b.x, Mint::md));
}
Mint operator-(Mint a, Mint b) {
	return Mint(mod(a.x - b.x, Mint::md));
}
Mint operator*(Mint a, Mint b) {
	return Mint(mod(a.x * b.x, Mint::md));
}
Mint operator/(Mint a, Mint b) {
	Mint c = Mint(MintNY(b.x));
	return Mint(mod(a.x * c.x, Mint::md));
}

Mint operator-(Mint a) {
	return Mint(-a.x);
}
bool operator==(Mint a, Mint b) {
	return a.x == b.x;
}
bool operator!=(Mint a, Mint b) {
	return a.x != b.x;
}
bool operator>(Mint a, Mint b) {
	return a.x > b.x;
}
bool operator<(Mint a, Mint b) {
	return a.x < b.x;
}
bool operator>=(Mint a, Mint b) {
	return a.x >= b.x;
}
bool operator<=(Mint a, Mint b) {
	return a.x <= b.x;
}

void operator+=(Mint &a, Mint b) {
	a = a + b;
}
void operator-=(Mint &a, Mint b) {
	a = a - b;
}
void operator*=(Mint &a, Mint b) {
	a = a * b;
}
void operator/=(Mint &a, Mint b) {
	a = a / b;
}

ostream& operator<<(ostream &out, Mint a) {
	out << a.x;
	return out;
}

istream& operator>>(istream &in, Mint &a) {
	in >> a.x;
	return in;
}

Mint factorial(LL n) {
	if (n == 0) {
		return Mint(1);
	}
	Mint res = 1;
	for (LL i = 1; i <= n; ++i) {
		res *= i;
	}
	return res;
}
Mint multiRange(LL s, LL t) {
	Mint res = 1;
	for (LL i = s; i <= t; ++i) {
		res *= i;
	}
	return res;
}

Mint getC(LL n, LL k) {
	if (n - k < k) {
		return getC(n, n - k);
	}
	return multiRange(n - k + 1, n) / factorial(k);
}

Mint getA(LL n, LL k) {
	return multiRange(n - k + 1, n);
}

Mint countNonNegativeDivision(LL n, LL k) {
	return getC(n + k - 1, k - 1);
}
Mint countPositiveDivision(LL n, LL k) {
	if (n < k) {
		return 0;
	}
	if (k <= 0) {
		return 0;
	}
	return getC(n - 1, k - 1);
}
Mint quickMod(Mint a, LL b) {
	Mint res = 1;
	while (b > 0) {
		if (b % 2) {
			res *= a;
		}
		a *= a;
		b /= 2;
	}
	return res;
}

LL Mint::md = 1000000007;

int t;
map<LL, LL> mp;
LL a, b, c, d;

LL getInf() {
	LL intInf = 2000000007;
	return intInf * intInf;
}

LL multi(LL a, LL b) {
	LL myInf = getInf();
	LL res = 0;
	LL aa = a, bb = b;
	while (aa < myInf && res < myInf && bb > (LL)(0)) {
		res += (bb & (LL)(1)) * aa;
		aa = aa * (LL)(2);
		bb = bb / (LL)(2);
	}
	if (aa >= myInf || res >= myInf) {
		return myInf; 
	} else {
		return res;
	}
}

LL dfs(LL x) {
    // cout << "dfs(" << x << ")" << endl;
    if (x == 0) {
        return 0;
    }
    if (x == 1) {
        return d;
    }
    if (mp.find(x) != mp.end()) {
        return mp[x];
    }

    LL res = multi(x, d);
    // printf("dfs(%lld) = %lld\n", x, res);
    res = min(res, (x % 2) * d + a + dfs(x / 2));
    // printf("dfs(%lld) = %lld\n", x, res);
    if (x % 2) {
        res = min(res, d + a + dfs((x + 1) / 2));
    }
    // printf("a = %lld, b = %lld, c = %lld, d = %lld\n", a, b, c, d);
    // printf("dfs(%lld) = %lld\n", x, res);
    res = min(res, (x % 3) * d + b + dfs(x / 3));
    // printf("dfs(%lld) = %lld\n", x, res);
    if (x % 3) {
        res = min(res, (3 - x % 3) * d + b + dfs((x / 3) + 1));
    }
    // printf("dfs(%lld) = %lld\n", x, res);
    res = min(res, (x % 5) * d + c + dfs(x / 5));
    // printf("dfs(%lld) = %lld\n", x, res);
    if (x % 5) {
        res = min(res, (5 - x % 5) * d + c + dfs((x / 5) + 1));
    }
    // printf("dfs(%lld) = %lld\n", x, res);

    mp[x] = res;
    // printf("dfs(%lld) = %lld\n", x, res);
    return res;
}

void work() {
    LL n;
    mp.clear();
    cin >> n >> a >> b >> c >> d;
    cout << dfs(n) << endl;
}

int main() {
    scanf("%d", &t);
    for (int i = 0; i < t; ++i) {
        work();
    }
	return 0;
}

Measured memory_bytes: 4524