#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define FWD(i, a, b) for(int i = (a); i < (b); i++)
using LL = long long;

const int N = 33 * 100;
LL dp[N];

int main(){
  int t;
  assert(scanf("%d", &t) == 1);
  while(t--){
    LL n;
    int abc[3];
    assert(scanf("%lld%d%d%d", &n, &abc[0], &abc[1], &abc[2]) == 4);
    sort(abc, abc+3);
    int a = abc[0];
    int b = abc[1];
    int c = abc[2];
    dp[0] = 1;
    FWD(i, 1, b) dp[i] = 1;
    FWD(i, b, 33 * c + 1){
      if(i >= c) dp[i] = dp[i-a] + dp[i-b] + dp[i-c];
      else dp[i] = dp[i-a] + dp[i-b];
    }
    int i = 0;
    while(dp[i] < n) i++;
    printf("%d\n", i);
  }
  return 0;
}