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
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int MOD = 1e9+7;
const int N = 300005;

ll tab[N];
ll dp[N];
bool parity=0;
ll sum[2]; // Suma przedzialow [parzystych/nieparzystych]

void solve1(int n){
    for(int i=1; i<=n; ++i){
        cin >> tab[i];
        tab[i] %= MOD;
    }
    dp[0]=1;
    for(int i=1; i<=n; ++i){
        if(tab[i]%2 == 0){
            sum[parity] += dp[i-1];
            sum[parity] %= MOD;
            dp[i] += sum[parity];
            dp[i] %= MOD;
        }else{
            parity ^= 1;
            sum[!parity] += dp[i-1];
            sum[!parity] %= MOD;
            dp[i] += sum[parity];
            dp[i] %= MOD;
        }
    }
    cout << dp[n];
}

void solve2(int n){
    for(int i=1; i<=n; ++i){
        cin >> tab[i];
        tab[i] %= MOD;
    }
    dp[0]=1;
    for(int i=1; i<=n; ++i){
        ll sum = 0;
        for(int j=i; j>=1; --j){
            sum += tab[j];
            sum %= MOD;
            if(sum % 2 == 0){
                dp[i] += dp[j-1];
            }
        }
    }
    cout << dp[n];
}

int main(){
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    if(n > 3005){
        solve1(n);
    }else{
        solve2(n);
    }
    return 0;
}