Minimum Watering Moves

Problem Statement: Benny has a grid of flowers arranged in an \( n \times n \) grid. In one move, he can water an entire row or an entire column. His goal is to water all the flowers in the grid.

Task: Given a grid of size \( n \), determine the minimum number of moves required to water all the flowers. It turns out that watering each row (or each column) once is sufficient, so the answer for each test case is \( n \).

You are given \( T \) test cases. For each test case, output the number of moves required.

inputFormat

The input begins with a single integer \( T \), the number of test cases. Each of the following \( T \) lines contains one integer \( n \) representing the grid size.

outputFormat

For each test case, output the minimum number of moves required on a separate line. Since the optimal strategy is to water all rows (or columns), the output for a given \( n \) is simply \( n \).

## sample

1
1

1

</p>