#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define MXN 112345
#define INF 112345000000000LL

int main()
{
    int t;
    cin>>t;
    long long arr[4],n;
    while(t--)
    {
        cin>>n>>arr[0]>>arr[1]>>arr[2];
        sort(arr,arr+3);
        long long dp[3201];
        dp[0] = 1;
        if(n == 1)
        {
            cout<<0<<"\n";
            continue;
        }
        for(int i=1;;i++)
        {
            dp[i] = dp[i-1];
            if(i >= arr[2])dp[i] = max(dp[i] , dp[i-arr[0]] + dp[i-arr[1]] + dp[i-arr[2]]);
            else if(i >= arr[1])dp[i] = max(dp[i] , dp[i-arr[0]] + dp[i-arr[1]] );
            //else if(i >= arr[0])dp[i] = max(dp[i] , dp[i-arr[0]]);
            if(dp[i] >= n)
            {
                cout<<i<<"\n";
                break;
            }
        }
    }
}