#include #define ll long long #define rep(i,x,n) for(ll i=x;i=n;i--) using namespace std; ll mod=1000000007; void solve(){ int n; cin>>n; int a[n]; rep(i,0,n) cin>>a[i]; sort(a,a+n); if(n==1) cout<<1<