#include <cstdio>
#include <map>
#define N 1000009
#define RI register int
#define Min(x, y) ((x) < (y) ? (x) : (y))
using namespace std;

bool ind = false;
map<int, int> mp;
int n, a[40], num[2][N], sa, ans;
map<int, int>::iterator iter;

inline int read();
void dfs(int now, int lim, int sum, int tim) {
    if (now > lim) {
        iter = mp.find(sum);
        if (iter == mp.end())
            mp[sum] = ++sa;
        ++num[tim][mp[sum]];
        return;
    }
    dfs(now + 1, lim, sum, tim);
    dfs(now + 1, lim, sum + a[now], tim ^ 1);
}
void dfs2(int now, int lim, int sum, int tim) {
    if (now > lim) {
        iter = mp.find(-sum);
        if (iter == mp.end())
            return;
        ans += num[tim][mp[-sum]];
        if (!sum && !tim)
            ++ans;
        return;
    }
    dfs2(now + 1, lim, sum, tim);
    dfs2(now + 1, lim, sum + a[now], tim ^ 1);
}

int main() {
    n = read();
    int n2 = Min(18, n);
    for (RI i = 1; i <= n; ++i) a[i] = read();
    dfs(1, n2, 0, 0);
    --num[0][mp[0]];
    if (n2 == n)
        return printf("%d\n", num[0][mp[0]]), 0;
    dfs2(n2 + 1, n, 0, 0);
    printf("%d\n", ans - 1);
    return 0;
}

inline int read() {
    int x = 0, fh = 1;
    char c = getchar();
    while (c > '9' || c < '0') fh = c == '-' ? -1 : fh, c = getchar();
    while (c >= '0' && c <= '9') {
        x *= 10;
        x += c - '0';
        c = getchar();
    }
    return x * fh;
}