#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
using namespace std;
#define root 1,n,1
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define lr rt<<1
#define rr rt<<1|1
typedef long long LL;
typedef pair<int,int>pii;
#define X first
#define Y second
const int oo = 1e9+7;
const double PI = acos(-1.0);
const double eps = 1e-6 ;
const int N = 10500;
const int mod = 1e9+7;
bool dp[105][N];
int n , m , a[N] , b[N] , tot ;
void init() {
    memset( dp , false ,sizeof dp );
    dp[0][0] = true ;
    for( int i = 1 ; i <= n ; ++i ){
        for( int j = 0 ; j <= tot ; ++j ){
            if( dp[i-1][j] ) dp[i][j] = dp[i-1][j];
            if( dp[i-1][j] ){
                dp[i][j+a[i]] = true ; dp[i][abs(j-a[i])] = true ;
            }
        }
    //    for( int j = 0 ; j <= tot ; ++j ) cout << dp[i][j] << ‘ ‘; cout << endl ;
    }
}
void Run() {
    tot = 0 ;
    for( int i = 1 ; i <= n ; ++i ) 
        cin >> a[i] , tot += a[i];
    init(); int cnt = 0 ;    
    for( int i = 1 ; i <= tot ; ++i ) if( !dp[n][i] ){
        b[cnt++] = i ;
    }
    cout << cnt << endl ;
    for( int i = 0 ; i < cnt ; ++i ) 
        cout << b[i] << (i+1==cnt?"\n":" ");

}
int main()
{
//    freopen("in.txt","r",stdin);
    ios::sync_with_stdio(false);
    while( cin >> n ) Run();
}