#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define IO ios::sync_with_stdio(false);cin.tie(0)

const int mod = 1e9 + 7;


int main() {
    IO; //freopen("in.txt", "r", stdin);
    int n; cin >> n;
    map<ll, ll> mp;
    vector<ll> dp(n + 5), pre(n + 5);
    dp[0] = 1;
    for(int i = 1; i <= n; ++i) {
        cin >> pre[i];
        pre[i] ^= pre[i - 1];
        if(i > 1) {
            dp[i] = ((dp[i - 1] + dp[i - 1] - mp[pre[i - 1]]) % mod + mod) % mod;
            mp[pre[i - 1]] = dp[i - 1];
        } else {
            dp[1] = 1;
        }
    }
    cout << dp[n] << '\n';
    return 0;
}