Maximum Non-Attacking Knights on an 8x8 Chessboard

You are given an integer (T) representing the number of test cases. For each test case, you are given an integer (n). Although (n) is provided as input, the final board size is fixed at (8 \times 8), and hence the maximum number of knights that can be placed on the board without any two attacking each other is always (32). This is because the optimal placement of knights on an 8x8 chessboard results in 32 safe knights regardless of the dummy value (n).

inputFormat

The input begins with an integer (T) denoting the number of test cases. Each of the following (T) lines contains a single integer (n), which is a dummy parameter. (n) does not affect the outcome since the board is always 8x8.

outputFormat

For each test case, print a single line containing the integer (32), representing the maximum number of non-attacking knights placing on an 8x8 chessboard.## sample

1
30

32