Max Days of Reading Spells

Sophie has a library in which spells are arranged in rows. Each row contains spells with different power levels. Sophie can read one entire row per day. Your task is to determine the maximum number of days she can spend reading spells, which, in fact, is simply the number of rows in the library for each test case.

Note that the power levels of the spells do not affect the outcome. In other words, if a test case has N rows, the answer for that test case is simply \( N \).

inputFormat

The first line of input contains an integer \( T \), representing the number of test cases.

For each test case:

• The first line contains an integer \( N \), the number of rows in the library.
• The following \( N \) lines each contain a sequence of space-separated integers representing the power levels of the spells in that row.

All input is read from standard input (stdin).

outputFormat

For each test case, output a single line with an integer representing the maximum number of days Sophie can spend reading, i.e. the number of rows \( N \) in that test case.

All output should be written to standard output (stdout).

## sample

2
4
10 20 15
5 25 5
18 4 6
7 4 11
3
8 8
5
7 7

4
3

</p>