///////////////////////////
// INFO //
// //
// Handle -> Scayre //
// //
// Template vers. 1.1 //
// //
// It'll be accepted //
// //
///////////////////////////
//████╗████████╗██╗███████╗══███╗═══███╗████████╗════//
//═██╔╝═══██╔══╝╚█║██╔════╝══████╗═████║██╔═════╝═══//
//═██║════██║════╚╝███████╗══██╔████╔██║█████╗══════//
//═██║════██║══════╚════██║══██║╚██╔╝██║██╔══╝══════//
//████╗═══██║══════███████║══██║═╚═╝═██║███████╗═════//
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <complex>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define ll long long
#define ld long double
#define ull unsigned ll
#define ioi exit(0);
#define f first
#define s second
#define inf (int)1e9 + 7
#define NFS ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define mp(x,y) make_pair(x,y)
#define lb(x) lower_bound(x)
#define ub(x) upper_bound(x)
#define pb push_back
#define ppb pop_back
#define bitcoin __builtin_popcount
#define endl "\n"
#define in(x) insert(x)
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define pw2(x) (1<<x) //2^x
#define forit(it,v) for (typeof(v.begin()) it = v.begin(); it != v.end(); ++it)
#define sqr(x) ((x) * 1ll * (x))
#define UpdateRandom srand (time(NULL));
using namespace std;
const int N = (int)5e5 + 7, MOD = (int)1e9 + 7;
int n,sum;
int cnt[N];
bool u[N];
int a[N];
int dp[N];
vector<int> v,b;
int main(){
#ifdef IOI2019
freopen ("in.txt", "r", stdin);
#endif
NFS
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
sum+=a[i];
}
if(sum%2==1){
cout << 0 << endl;
ioi
}
memset(dp,-1,sizeof(dp));
dp[0]=0;
for(int i=1;i<=n;i++){
for(int j=sum/2;j>=a[i];j--){
if(dp[j-a[i]]!=-1 && dp[j]==-1){
dp[j]=i;
}
}
}
if(dp[sum/2]==-1){
cout << 0 << endl;
ioi
}
for(int k=1;k<=n;k++){
int x=a[k];
a[k]=0;
memset(u,0,sizeof(u));
memset(dp,-1,sizeof(dp));
dp[0]=0;
sum-=x;
for(int i=1;i<=n;i++){
for(int j=sum;j>=a[i];j--){
if(dp[j-a[i]]!=-1 && dp[j]==-1){
dp[j]=i;
}
}
}
//cout << k << endl;
for(int j=sum;j>=0;j--){
if(dp[j]!=-1){
if(u[abs(j-(sum-j))]!=1){
cnt[abs(j-(sum-j))]++;
}
u[abs(j-(sum-j))]=1;
}
}
//cout << endl;
a[k]=x;
sum+=x;
}
for(int i=1;i<=sum;i++){
if(cnt[i]==n){
v.pb(i);
}
}
cout << sz(v) << endl;
for(int i=0;i<sz(v);i++){
cout << v[i] << ' ';
}
#ifdef IOI2019
cout << "\nTime Elapsed : " << clock () * 1.0 / CLOCKS_PER_SEC << endl;
#endif
ioi
}
