Stable Sequence Reduction

You are given a sequence of positive integers. Your task is to determine the minimal possible length of the sequence after it becomes stable.

A sequence is considered stable if the greatest common divisor (GCD) of its elements does not change by any further operations. In this problem, an operation may combine elements (or equivalently, the entire sequence can be reduced) so that eventually the sequence cannot be reduced further while maintaining the overall GCD, i.e. $$G = \gcd(a_1, a_2, \ldots, a_n).$$

It turns out that no matter the sequence provided, if the sequence is reduced optimally, the minimal length possible is 1. Your task is to simply output 1 for each test case.

Note: Although the problem statement might seem trivial, ensure that your solution correctly reads from standard input and writes to standard output according to the format described below.

inputFormat

The input starts with an integer t (the number of test cases). Each test case begins with an integer n representing the length of the sequence, followed by a line containing n space-separated positive integers.

Input is read from stdin.

outputFormat

For each test case, output the minimal possible length of the sequence after it becomes stable. Since the answer is always 1, print 1 for each test case on a separate line. Output should be written to stdout.

## sample

3
3
6 12 15
4
8 4 2 6
2
7 5

1
1
1

</p>