#include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const int maxc = 5000;

int a, b, c; 
ll n, dp[maxc];

int solve() {
    cin >> n >> a >> b >> c;
    if (n == 1) {
        return 0;
    }
    dp[0] = 1;
    for (int i = 1; i < maxc; i++) {
        dp[i] = 0;
        if (i >= a) {
            dp[i] += dp[i - a];
        }
        if (i >= b) {
            dp[i] += dp[i - b];
        }
        if (i >= c) {
            dp[i] += dp[i - c];
        }
        dp[i] = max(dp[i-1], dp[i]);
        if (dp[i] >= n) {
            return i;
        }
    }
    return -1;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int numtests;
    cin >> numtests;
    for (int i = 0; i < numtests; i++) {
        cout << solve() << '\n';
    }
    return 0;
}