#include <bits/stdc++.h>
using namespace std;
using ll = __int128;
using vi = vector<int>;
#define pb push_back
const int N = 3e5 + 5;
const ll m = 1e9 + 7;
int n;

long long a[N];

map<pair<ll, ll>, ll> mp;

ll f(int i, ll base) {
    base = base ^ a[i] % m;
    if (mp.find({i, base}) != mp.end()) {
        return mp[{i, base}];
    }
    if (i < n-1) {
        mp[{i, base}] = (base * f(i+1, 0) % m + f(i+1, base) % m) % m;
        return mp[{i, base}];
    }
    mp[{i, base}] = base % m;
    return mp[{i, base}];
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[i] %= m;
    }

    ll ans = f(0, 0) % m;
    if (ans < 0) ans += m;
    long long res = ans;
    cout << res << '\n';
    return 0;
}