#include <iostream>
using namespace std;

const int Nmax = 32000;

long long v[Nmax];

inline long long acc(int x){
    return x >= 0 ? v[x] : 0;
}

int main(){
    int times, A, B, C, p;
    long long n;
    
    v[0] = 1;
    cin >> times;
    while (times--){
        cin >> n >> A >> B >> C;
        
        int p = 0;
        while (v[p] < n){
            p++;
            v[p] = max( v[p - 1], acc(p - A) + acc(p - B) + acc(p - C) );
        }
        cout << p << '\n';
    }
    return 0;
}