Problem Statement:
Given two integers A and B, A modulo B is the remainder when dividing A by B. For example, the numbers 7, 14, 27 and 38 become 1, 2, 0 and 2, modulo 3. Write a program that accepts 10 numbers as input and outputs the number of distinct numbers in the input, if the numbers are considered modulo 42.


Input Format:
The first line has an integer T, number of test cases. For each test case, The input will contain 10 nonnegative integers, each smaller than 1000, one per line.


Output Format:
For each case, Output the number of distinct values when considered modulo 42 on a single line.


Sample Input:
2 1 2 3 4 5 6 7 8 9 10 39 40 41 42 43 44 82 83 84 85


Sample Output:
10 6


Notes:
Example Clarification:

In the first example, the numbers modulo 42 are 1, 2, 3, 4, 5, 6, 7, 8, 9 and 10.
In the second, the numbers modulo 42 are 39, 40, 41, 0, 1, 2, 40, 41, 0 and 1. There are 6 distinct numbers.

Original Source: COCI 2006





Added by: ahm.kam_92
Added at: 2014-09-17 18:28:51 UTC
Time Limit: 1 second
Partial score: No
Source:AAST Individuals Qualification 2014 #2