#include <bits/stdc++.h>
#define LL long long
using namespace std;
LL dp[100005],n;
int a,b,c,t;
LL f(int cur){
	if(cur<0) return 0;
	else return dp[cur];
}
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%lld %d %d %d",&n,&a,&b,&c);
		dp[0]=1;
		if(n==1){
			printf("0\n");
			continue;
		}
		for(int i=1;;i++){
			dp[i]=max(f(i-a)+f(i-b)+f(i-c),1LL);
			if(dp[i]>=n){
				printf("%d\n",i);
				break;
			}
		}
	}
	return 0;
}