Taco Partition Problem

You are given a positive integer N. The task is to determine the number of ways to partition N into a sum of positive integers such that the sum of squares of the partitioned numbers is minimized. Mathematical observation shows that the minimum sum of squares is achieved when all numbers in the partition are 1, resulting in a sum of squares equal to N (i.e. \(N\times1^2 = N\)). Therefore, for any given N, there is exactly one partition that attains this minimum.

You are required to process multiple test cases. For each test case, simply output 1 because the minimum partition is unique.

Note: All mathematical formulas are provided in \(\LaTeX\) format.

inputFormat

The first line of the input contains an integer Q representing the number of test cases. The following Q lines each contain an integer N, representing the number for which the partition is to be computed.

Input is provided via standard input (stdin).

outputFormat

For each test case, output a single line containing the number 1 (since there is only one partition that minimizes the sum of squares) via standard output (stdout).

1
5

1