#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;
void no(){
cout << "0\n";
exit(0);
}
const int M = 250000;
int d[M+505], dp[M+505];
vi cnt(M+4);
int main()
{
int n;
cin >> n;
vi a(n);
int suma = 0;
bool pp = 0, np = 0;
for (auto& i : a){
cin >> i;
suma += i;
if (i%2)
np=1;
else
pp=1;
}
if ((pp && np) || suma%2) no();
dp[0]=1;
for (int i = 0; i < n; ++i){
for (int j = M; j > -1; --j){
dp[a[i]+j] += dp[j];
}
}
if (!dp[suma/2]) no();
vi sol;
for (int i = 0; i < n; ++i){
memset(d, 0, sizeof(d));
for (int j = 0; j <= M; ++j){
d[j] += dp[j];
d[j+a[i]] -= d[j];
}
for (int j = 0; j <= M; ++j){
if ((suma-a[i]+j)%2 == 0 && suma-a[i]-j>=0 && d[(suma-a[i]-j)/2]){
++cnt[j];
}
}
}
for (int i = 1; i <= M; ++i)
if (cnt[i] == n)
sol.push_back(i);
cout << (int)sol.size() << '\n';
for (auto& i : sol)
cout << i << ' ';
}
