#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int T, A, B, C;
    cin >> T;
    for(int c=0;c<T;c++){
        long long int N;
        cin >> N >> A >> B >> C;
        long long int ways[5000] = {0};
        int idx = 0;
        ways[0] = 1;
        while(ways[idx] < N){
            idx++;
            if(idx - A >= 0) ways[idx] += ways[idx-A];
            if(idx - B >= 0) ways[idx] += ways[idx-B];
            if(idx - C >= 0) ways[idx] += ways[idx-C];
            ways[idx] = max(ways[idx], ways[idx-1]);
        }
        cout << idx << endl;
    }
    return 0;
}