#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef long long ll;

const int N = (int)1e4;
ll dp[N];

int solve()
{
	ll n;
	int a, b, c;
	cin >> n >> a >> b >> c;
	for (int i = 0;; i++)
	{
		dp[i] = (i >= a ? dp[i - a] : 0) + (i >= b ? dp[i - b] : 0) + (i >= c ? dp[i - c] : 0);
		if (dp[i] == 0) dp[i] = 1;
		if (dp[i] >= n) return i;
	}
	throw;
}

int main()
{
	int t;
	scanf("%d", &t);
	while(t--)
		printf("%d\n", solve());

	return 0;
}