#include <atcoder/modint>
#include <iostream>
#include <vector>
#include <map>

using namespace std;
using mint = atcoder::modint1000000007;

void solve() {
    int n;
    cin >> n;

    map<int, mint> cnt;
    mint sum = 1;
    int xsum = 0;
    while (n--) {
        int x;
        cin >> x;
        xsum ^= x;

        auto psum = sum;
        if (cnt.count(xsum)) sum -= cnt[xsum];
        cnt[xsum] = psum;
        sum += psum;
    }

    cout << cnt[xsum].val() << "\n";
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();

    return 0;
}