#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr int N = 50005;
void solve() {
int n;
cin >> n;
vector<int> a(n), pre(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
pre[i + 1] = pre[i] + a[i];
}
vector<int> dp(N + 1, -1);
dp[0] = 0;
vector<bool> ans(n, true);
for (int i = 0; i < n; i++) {
for (int j = N; j >= a[i]; j--) {
dp[j] = max(dp[j], dp[j - a[i]]);
}
dp[a[i]] = i;
for (int j = 0; j <= i; j++) {
int sum = pre[i + 1] - pre[j];
if (sum % 2 != 0 || dp[sum / 2] < j) {
ans[i - j] = false;
}
}
}
vector<int> res;
for (int i = 0; i < n; i++) {
if (ans[i])
res.push_back(i + 1);
}
cout << res.size() << " ";
for (int x : res) {
cout << x << " ";
}
cout << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
