#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for(int i = (a); i < int(b); ++i)
#define rrep(i, a, b) for(int i = (a) - 1; i >= int(b); --i)
#define trav(it, v) for(typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define all(v) (v).begin(), (v).end()

typedef double fl;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
	
ll N;
int A, B, C;
ll dp[6000];

ll getLen(int money){
	if(money < 0)
		return 0;
	return dp[money];
}

void solve(){
	scanf("%lld%d%d%d", &N, &A, &B, &C);
	if(N == 1){
		printf("0\n");
		return;
	}
	dp[0]=1;
	for(int money=1; true; ++money){
		dp[money]=max(getLen(money-A)+getLen(money-B)+getLen(money-C), 1LL);
		if(dp[money] >= N){
			printf("%d\n", money);
			return;
		}
	}
}

int main(){
	int T;
	scanf("%d", &T);
	while(T--){
		solve();
	}
}