t = int(input())
for _ in range(0,t):
n = int(input())
list1 = [int(num) for num in input().split()]
set1 = set(list1)
if(len(set1)>=2):
print(1)
else:
print(len(list1))#include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--){
int n;
cin>>n;
int a[n];
int counter=0;
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
for (int i = 0; i < n-1; ++i)
{
if(a[i]==a[i+1]){
counter++;
}
}
if (counter==n-1)
{
cout<<n<<endl;
}else{
cout<<"1"<<endl;
}
}
return 0;
}1279A - New Year Garland | 1279B - Verse For Santa |
202A - LLPS | 978A - Remove Duplicates |
1304A - Two Rabbits | 225A - Dice Tower |
1660D - Maximum Product Strikes Back | 1513A - Array and Peaks |
1251B - Binary Palindromes | 768B - Code For 1 |
363B - Fence | 991B - Getting an A |
246A - Buggy Sorting | 884A - Book Reading |
1180A - Alex and a Rhombus | 445A - DZY Loves Chessboard |
1372A - Omkar and Completion | 159D - Palindrome pairs |
981B - Businessmen Problems | 1668A - Direction Change |
1667B - Optimal Partition | 1668B - Social Distance |
88B - Keyboard | 580B - Kefa and Company |
960A - Check the string | 1220A - Cards |
897A - Scarborough Fair | 1433B - Yet Another Bookshelf |
1283B - Candies Division | 1451B - Non-Substring Subsequence |