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
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define ST first
#define ND second
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef set<int> SI;
typedef long long LL;

#ifdef DEBUG
const bool debug = true;
#else
const bool debug = false;
#endif

// #define MULTI_TASK true

const int INF = 1000 * 1000 * 1000;
const LL INFLL = 1e18;
const int MAKSN = 1000 * 1000 + 13;
const LL MOD = ((LL)1e9 + 7);
LL N, M, k, l, a, b, c, d, maks = 0;
vector<LL> v;

void zeruj() {
    v.clear();
}

void readIn() {
    cin >> N;
    REP(i, N) {
        cin >> k;
        v.push_back(k);
        maks = max(maks, k);
    }
}

void addMod(LL& where, LL plus) {
    where = (where + plus) % MOD;
}

bool isMopulo(LL cur_sum) {
    return ((cur_sum % MOD) % 2 == 0);
}

void solveSmallNumbers() {
    LL ans = 0;
    LL cur_sum = v[0];
    int i = 1;
    while (i < N && !isMopulo(cur_sum)) {
        addMod(cur_sum, v[i]);
        i++;
    }

    if (isMopulo(cur_sum))
        ans = 1;

    while (i < N) {
        cur_sum = v[i];
        i++;
        while (i < N && !isMopulo(cur_sum)) {
            addMod(cur_sum, v[i]);
            i++;
        }

        if (isMopulo(cur_sum)) {
            ans = (ans * 2) % MOD;
        } else {
            ans = 0;
            break;
        }
    }

    if (!isMopulo(cur_sum))
        ans = 0;

    cout << ans << "\n";
}

void solve2() {
    vector<LL> dp;
    v.insert(v.begin(), 0);
    dp.push_back(1);

    for (int i = 1; i <= N; i++) {
        LL curans = 0;
        LL cursum = 0;
        for (int j = i; j > 0; j--) {
            addMod(cursum, v[j]);
            if (isMopulo(cursum)) {
                addMod(curans, dp[j - 1]);
            }
        }
        dp.push_back(curans);
    }

    cout << dp.back() << "\n";
}

void solve() {
    if (maks <= 500)
        solveSmallNumbers();
    else {
        solve2();
    }
}

int main() {
    ios_base::sync_with_stdio(0);
#ifdef MULTI_TASK
    int test;
    cin >> test;
    while (test--) {
#endif
        zeruj();
        readIn();
        solve();
#ifdef MULTI_TASK
    }
#endif
    return 0;
}