#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <queue>
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <ctime> 
#include <cstring> 


using namespace std;


int T;
int a, b, c;
long long N;

long long solves[5200];

void solve()
{
	for (scanf("%d", &T); T; T--) {
		scanf("%lld %d %d %d", &N, &a, &b, &c);
		solves[0] = 1;
		int test = 0;
		while (solves[test] < N) {
			test++;
			solves[test] = 0;
			if (test >= a) solves[test] += solves[test - a];
			if (test >= b) solves[test] += solves[test - b];
			if (test >= c) solves[test] += solves[test - c];
			if (solves[test] == 0) solves[test] = 1;
		}
		printf("%d\n", test);
	}
}
int main() {
    solve();
}