#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

#define ll long long

int main()
{
    int t;
    scanf("%d", &t);

    while (t--) {
        vector<int> d(3);

        ll n;
        scanf("%lld", &n);

        for (int i = 0; i < 3; i++) {
            scanf("%d", &d[i]);
        }

        sort(begin(d), end(d));

        vector<ll> c(1000005, 0);

        int i = 0;

        while (true) {
            if (i >= d[1]) {
                c[i] = c[i - d[0]] + c[i - d[1]];

                if (i >= d[2]) {
                    c[i] += c[i - d[2]];
                }
            } else {
                c[i] = 1;
            }

            if (c[i] >= n) {
                printf("%d\n", i);

                break;
            }

            i++;
        }
    }

    return 0;
}