#include <bits/stdc++.h>
using namespace std;
long long int dp[10000];
int min_cost(long long int val, int ub)
{
	int lo = 0, hi = ub, mid;
	while(lo < hi)
	{
		mid = (lo+hi)/2;
		if(dp[mid] >= val)
			hi = mid;
		else
			lo = mid+1;
	}
	return lo;
}
int main()
{
	// freopen("input.txt", "r", stdin);
	ios_base::sync_with_stdio(0);
	int t;
	cin>>t;
	while(t--)
	{
		long long int n;
		cin>>n;
		int a,b,c;
		cin>>a>>b>>c;
		int lala[] = {a,b,c};
		sort(lala, lala+3);
		a = lala[0];
		b = lala[1];
		c = lala[2];
		dp[0] = 1;
		int ans = 0;
		while(dp[ans] < n)
		{
			ans++;
			long long int temp = dp[ans-1];
			if(ans >= b)
				temp = dp[ans-a]+dp[ans-b];
			if(ans >= c)
				temp+=dp[ans-c];
			dp[ans] = temp;
		}
		cout<<ans<<"\n";
	}
}