1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#define pb push_back
#define mp make_pair
#define fi first
#define se second 
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector <int> vi;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
constexpr ll nax = 2e5+6969, INF = 2e9+6969;

int n,t[nax];

bool ok(vi & v)
{
	bitset<nax> b;
	b.reset();
	b[0] = 1;
	int sum = 0;
	for(auto e: v) sum += e;
	for(auto e: v)
	for(int i = sum; i >= e; i--)
	{
		if(b[i-e]) b[i] = 1;
	}
	for(int i=0;i<=sum;i++)
	{
		if(b[i] == 0) return false;
	}
	return true;
}

int main()
{
	scanf("%d", &n);
	int ans = 0;
	for(int i=0;i<n;++i) scanf("%d", &t[i]);
	for(int i=1;i<(1<<n);++i)
	{
		vi v;
		for(int j=0;j<n;++j) if(i&(1<<j)) v.pb(t[j]);
		if(ok(v))
		{
			ans++;
			//  puts("found:");
			//  for(auto e: v) printf("%d ", e);
			//  puts("");
		}
	}
	printf("%d\n", ans);
	//  printf("total: %d\n", ans);
	return 0;
}