//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x << " = " << x << endl;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;
const ll N = 100+5 , M = 10000+5;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;
using namespace std;
bitset<M> dp[N];
int a[N];
vector<int> ans;
void solve(){
int n;
cin >> n;
ll sum = 0;
dp[0][0] = 1;
for(int i = 1; i <= n ; i++) {
cin >> a[i];
sum += a[i];
dp[0] |= (dp[0] << a[i]);
}
if(sum % 2 == 1 || dp[0][sum] == 0 || dp[0][sum/2] == 0){
cout << "0\n";
return;
}
for(int i = 1; i <= n; i++){
dp[i][0] = 1;
for(int j = 1; j <= n; j++){
if(i != j) dp[i] |= (dp[i] << a[j]);
}
}
for(int i = 1; i <= sum; i++){
int cnt = 0;
for(int j = 1; j <= n; j++){
bitset<M> res = dp[j];
int sum1 = sum-a[j] + i;
// res |= (res << i);
if(sum1 % 2 == 0 && (res[sum1/2] == 1 || (sum1/2-i >= 0 && res[sum1/2-i] == 1))) cnt++;
}
if(cnt==n) ans.pb(i);
}
cout << ans.sz() <<"\n";
for(int x : ans) cout << x <<" ";
}
signed main(){
ios;
solve();
return 0;
}
/*
*/
