def solve(n,x,y,z):
    if n == 1: return 0
    d = {0:1}
    p = 1
    v = 1
    while v < n:
        nt = [0,0,0]
        if p - x >= 0: nt[0] = d[p-x]
        if p - y >= 0: nt[1] = d[p-y]
        if p - z >= 0: nt[2] = d[p-z]
        v = max(sum(nt),1)
        d[p] = v
        t = nt
        p += 1
    return p - 1


t = int(raw_input())
for _ in xrange(t):
    n,a,b,c = map(int,raw_input().split())
    a,b,c = sorted([a,b,c])
    print solve(n,a,b,c)