Bhanu Bhai and his friends bought a giant subway of length "n". Bhanu is assigned a duty of cutting the sub in as many pieces as possible. But his friends gave him condition that  each piece should be either of length x, y or z. Since Bhanu is busy eating a pizza, he assigns you a task to maximise number of pieces.

Input

• First line contains T, number of test cases.
• First line of each test case contains n, the length of the subway.
• Second line of each test case contains x, y and z respectively.

Output

• Print maximum number of subs into which the entire giant sub can be divided in, on a new line.

Constraints

• 1 <= t <= 70
• 1 <= n, x, y, z <= 4000