CF1392A.Omkar and Password

Lord Omkar has permitted you to enter the Holy Church of Omkar! To test your worthiness, Omkar gives you a password which you must interpret!

A password is an array $a$ of $n$ positive integers. You apply the following operation to the array: pick any two adjacent numbers that are not equal to each other and replace them with their sum. Formally, choose an index $i$ such that $1 \leq i \lt n$ and $a_{i} \neq a_{i+1}$, delete both $a_i$ and $a_{i+1}$ from the array and put $a_{i}+a_{i+1}$ in their place.

For example, for array $[7, 4, 3, 7]$ you can choose $i = 2$ and the array will become $[7, 4+3, 7] = [7, 7, 7]$. Note that in this array you can't apply this operation anymore.

Notice that one operation will decrease the size of the password by $1$. What is the shortest possible length of the password after some number (possibly $0$) of operations?

奥姆卡尔大人允许你进入神圣的奥姆卡尔教堂！为了测试你的资格，奥姆卡尔给了你一个密码，你必须解读它！

密码是一个由 $n$ 个正整数组成的数组 $a$。你需要对数组执行如下操作：任选两个相邻且不相等的数，并将它们替换为它们的和。形式化地说，选择一个下标 $i$，满足 $1 \leq i < n$ 且 $a_{i} \neq a_{i+1}$，从数组中删除 $a_i$ 和 $a_{i+1}$，并在原位置插入 $a_{i}+a_{i+1}$。

例如，对于数组 $[7, 4, 3, 7]$，你可以选择 $i = 2$，数组将变为 $[7, 4+3, 7] = [7, 7, 7]$。注意，在该数组中已无法再执行此操作。

注意，每次操作会使密码长度减少 $1$。在执行若干次（可能为 $0$ 次）操作后，密码可能达到的最短长度是多少？

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). Description of the test cases follows.

The first line of each test case contains an integer $n$ ($1 \leq n \leq 2 \cdot 10^5$) — the length of the password.

The second line of each test case contains $n$ integers $a_{1},a_{2},\dots,a_{n}$ ($1 \leq a_{i} \leq 10^9$) — the initial contents of your password.

The sum of $n$ over all test cases will not exceed $2 \cdot 10^5$.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 100$）。随后是测试用例的描述。

每个测试用例的第一行包含一个整数 $n$（$1 \leq n \leq 2 \cdot 10^5$）—— 密码的长度。

每个测试用例的第二行包含 $n$ 个整数 $a_{1},a_{2},\dots,a_{n}$（$1 \leq a_{i} \leq 10^9$）—— 密码的初始内容。

所有测试用例中 $n$ 的总和不超过 $2 \cdot 10^5$。

For each password, print one integer: the shortest possible length of the password after some number of operations.

对于每个密码，输出一个整数：经过若干次操作后密码的最短可能长度。

In the first test case, you can do the following to achieve a length of $1$:

Pick $i=2$ to get $[2, 4, 1]$

Pick $i=1$ to get $[6, 1]$

Pick $i=1$ to get $[7]$

In the second test case, you can't perform any operations because there is no valid $i$ that satisfies the requirements mentioned above.

在第一个测试用例中，你可以执行以下操作以得到长度为 $1$ 的数组：

选择 $i=2$，得到 $[2, 4, 1]$；
选择 $i=1$，得到 $[6, 1]$；
选择 $i=1$，得到 $[7]$。

在第二个测试用例中，你无法执行任何操作，因为不存在满足上述要求的合法下标 $i$。