// #pragma GCC optimize ("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>

using std::cin, std::cout, std::cerr;
using ll = long long;

const ll P = 1e9 + 7;

int main() {
    std::ios::sync_with_stdio(false);
    int n; cin >> n;
    std::vector<int> a(n + 1);
    for(int i = 1; i <= n; i ++)
        cin >> a[i];

    std::map<int, int> map;
    std::vector<ll> f(n + 1), sum(n + 1);
    f[0] = 1;
    sum[0] = 1;
    int pre = 0;
    for(int i = 1; i <= n; i ++) {
        pre ^= a[i];
        f[i] = sum[i - 1];
        if(i != n && map.count(pre)) {
            f[i] -= sum[map[pre] - 1];
        }
        map[pre] = i;
        f[i] %= P;
        sum[i] = (sum[i - 1] + f[i]) % P;
    }

    ll ans = f[n];
    ans = (ans % P + P) % P;
    cout << ans << '\n';
}