#include <bits/stdc++.h>
using namespace std;
int lArraySum[131074];
int rArraySum[262146];
int main() {
    int lArray[17];
    int rArray[18];
    memset(lArraySum, 0, sizeof(lArraySum));
    memset(rArraySum, 0, sizeof(rArraySum));
    int n;
    long long ans = 0;
    scanf("%d", &n);
    int lSize = n / 2;
    int rSize = n - n / 2;
    for (int i = 0; i < (n >> 1); i++) {
        int temp;
        scanf("%d", &temp);
        lArray[i] = temp;
    }
    for (int i = (n >> 1); i < n; i++) {
        int temp;
        scanf("%d", &temp);
        rArray[i - (n >> 1)] = temp;
    }
    for (int i = 1; i < (1 << lSize); i++) {
        for (int j = 0; j < lSize; j++) {
            if ((i >> j) & 1)
                lArraySum[i] += lArray[j];
        }
    }
    for (int i = 1; i < (1 << rSize); i++) {
        for (int j = 0; j < rSize; j++) {
            if ((i >> j) & 1)
                rArraySum[i] += rArray[j];
        }
    }
    sort(lArraySum + 1, lArraySum + (1 << lSize));
    sort(rArraySum + 1, rArraySum + (1 << rSize));
    int p1 = 1, p2 = (1 << rSize) - 1;
    int p1Same = 1;
    int p2Same = 1;
    while (p1 < (1 << lSize) && p2 > 0) {
        if (p1 < (1 << lSize) - 1 && lArraySum[p1 + 1] == lArraySum[p1]) {
            p1Same++;
            p1++;
            continue;
        }
        if (p2 > 1 && rArraySum[p2 - 1] == rArraySum[p2]) {
            p2Same++;
            p2--;
            continue;
        }
        if (lArraySum[p1] + rArraySum[p2] == 0) {
            if (lArraySum[p1] == 0) {
                ans += p1Same + p2Same;
            }
            ans += p1Same * p2Same;
            p1++;
            p2--;
            p1Same = 1;
            p2Same = 1;
            continue;
        }
        if (lArraySum[p1] + rArraySum[p2] > 0) {
            if (rArraySum[p2] == 0) {
                ans += p2Same;
            }
            if (p2 != 1) {
                p2Same = 1;
                p2--;
                continue;
            } else {
                p2--;
                break;
            }
        } else {
            if (lArraySum[p1] == 0) {
                ans += p1Same;
            }
            if (p1 != (1 << rSize)) {
                p1++;
                p1Same = 1;
                continue;
            } else {
                p1++;
                break;
            }
        }
    }
    if (p1 < (1 << lSize)) {
        if (lArraySum[p1] == 0) {
            ans += p1Same;
        } else {
            for (int i = p1; i < (1 << lSize) && lArraySum[i] <= 0; i++) {
                if (lArraySum[i] < 0)
                    continue;
                ans++;
            }
        }
    }
    if (p2 > 0) {
        if (rArraySum[p2] == 0) {
            ans += p2Same;
        } else {
            for (int i = p2; i > 0 && rArraySum[i] >= 0; i--) {
                if (rArraySum[i] > 0)
                    continue;
                ans++;
            }
        }
    }
    printf("%lld", ans);
}