#include using namespace std; using ll = long long; using ld = long double; using VI = vector; using VL = vector; using VS = vector; template using PQ = priority_queue, greater>; using graph = vector; template using w_graph = vector>>; #define FOR(i,a,n) for(int i=(a);i<(n);++i) #define eFOR(i,a,n) for(int i=(a);i<=(n);++i) #define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i) #define erFOR(i,a,n) for(int i=(n);i>=(a);--i) #define SORT(a) sort(a.begin(),a.end()) #define rSORT(a) sort(a.rbegin(),a.rend()) #define fSORT(a,f) sort(a.begin(),a.end(),f) #define all(a) a.begin(),a.end() #define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x)) #define tp(a,i) get(a) #ifdef _DEBUG #define line cout << "-----------------------------\n" #define stop system("pause") #endif constexpr ll INF = 1000000000; constexpr ll LLINF = 1LL << 60; constexpr ll mod = 1000000007; constexpr ll MOD = 998244353; constexpr ld eps = 1e-10; constexpr ld pi = 3.1415926535897932; templateinline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; } templateinline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; } inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } templateinline istream& operator>>(istream& is, vector& v) { for (auto& a : v)is >> a; return is; } templateinline istream& operator>>(istream& is, pair& p) { is >> p.first >> p.second; return is; } templateinline vector vec(size_t a) { return vector(a); } templateinline vector defvec(T def, size_t a) { return vector(a, def); } templateinline auto vec(size_t a, Ts... ts) { return vector(ts...))>(a, vec(ts...)); } templateinline auto defvec(T def, size_t a, Ts... ts) { return vector(def, ts...))>(a, defvec(def, ts...)); } templateinline void print(const T& a) { cout << a << "\n"; } templateinline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); } templateinline void print(const vector& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); } templateinline void print(const vector>& v) { for (auto& a : v)print(a); } inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; } templateinline T sum(const vector& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); } templateinline void END(T s) { print(s); exit(0); } void END() { exit(0); } struct BIT { int n; VI dat; BIT(int n, int a) :n(n), dat(n + 1) { eFOR(i, 1, n) { dat[i] += a; if (i + (i & -i) <= n)dat[i + (i & -i)] += dat[i]; } } void add(int i, int a) { for (++i; i <= n; i += i & -i)dat[i] += a; } int lower_bound(int a) { int res = 0, k = 1; for (; k * 2 <= n; k *= 2); for (; k; k /= 2) { if (res + k <= n && a > dat[res + k]) { a -= dat[res + k]; res += k; } } return res; } }; #include "testlib.h" int main() { init(); registerValidation(); int n = inf.readInt(1, 20000); inf.readEoln(); VI a(n); FOR(i, 0, n) { if (i)inf.readSpace(); a[i] = inf.readInt(0, 1023); } inf.readEoln(); inf.readEof(); VI s(a); FOR(i, 1, n)s[i] += s[i - 1]; int lim = 1024; auto dp = vec(n + 1, 2, lim); dp[0][1][0] = 1; vector is(lim * n); is[s.back()] = true; int ans = 1; FOR(i, 0, n) { FOR(j, 0, 2)FOR(k, 0, lim) { if (dp[i][j][k]) { dp[i + 1][0][(k + a[i]) & (lim - 1)] = true; dp[i + 1][1][k & a[i]] = true; } } FOR(k, 0, lim) { if (int tmp = k + sum(s, i + 1, n - 1); dp[i + 1][1][k] && !is[tmp]) { ++ans; is[tmp] = true; } } print(ans); } return 0; }