Describe your issue
The logic is absolutely right but It is not accepting .
include <bits/stdc++.h>
using namespace std;
define f(n) for (int i = 0; i < n; i++)
define f1(n) for (int i = 1; i < n; i++)
define fj(n) for (int j = 0; j < n; j++)
define s(x) sort(x.begin(),x.end());
define int long long
int solve() {
int n;
cin>>n;
int A[n];
f(n) cin>>A[i];
int N=0;
f(n) N+=A[i];
if(n==1) return 1;
int a=A[0];
int ds=-1;
for(int i=1;i<n;i++){
if(A[i]!=a) ds=0;
}
if(ds==-1&&a!=1) return n;
if(ds==-1&&a==1) return 1;
int count=0;
for(int i=0;i<n-1;i++){
if(A[i]>=2) count++;
}
return min(n,count+1);
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
cout<<solve()<<endl;
}
return 0;
}