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
#include <iostream>
#include <vector>
#include <algorithm>

#ifdef TEST_MODE
#include <fstream>
#endif

using namespace std;

typedef long long ll;

const int kMaxNoNumbers = 300000;
const int kModulo= 1000000007;
//const int kModulo= 17;

bool isMopadulo(int number) {
    if ( (number % kModulo) % 2 == 0 )
        return true;
    else
        return false;
}

int main() {
#ifdef TEST_MODE
    std::ifstream in("1.in"); std::cin.rdbuf(in.rdbuf());
#endif
    std::ios_base::sync_with_stdio(false);
    
    int numbers[kMaxNoNumbers];
    int sequencesNumber[kMaxNoNumbers+1];
    
    int n;
    
    cin >> n;
    for ( int i = 0; i < n; ++i ) {
        cin >> numbers[i];
    }
   

    sequencesNumber[0] = 1;
    
    for ( int i = 1; i <= n; ++i ) {
        sequencesNumber[i] = 0;
        
        int tmpModuloSum = 0;
        for ( int j = i ; j > 0; --j ) {
            tmpModuloSum += numbers[j-1];
            tmpModuloSum %= kModulo;
            if ( isMopadulo(tmpModuloSum) ) {
                sequencesNumber[i] += sequencesNumber[j-1];
                sequencesNumber[i] %= kModulo;
            }
        }
    }
    
    cout << sequencesNumber[n] << endl;
    return 0;
}