#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 1e9 + 7;

void inc(ll &a, ll b) {
    a += b;
    if (a >= mod) a -= mod;
}
void dec(ll &a, ll b) {
    a -= b;
    if (a < 0) a += mod;
}
ll add(ll a, ll b) {
    a += b;
    return a >= mod ? a - mod : a;
}
ll del(ll a, ll b) {
    a -= b;
    return a < 0 ? a + mod : a;
}
ll qmi(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}
ll inv(ll a) {
    return qmi(a, mod - 2);
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<vector<ll>> g(30, vector<ll>(2));
    for (int i = 0; i < 30; ++i) g[i][0] = 1;
    ll f;
    int s = 0;
    for (int i = 1; i <= n; ++i) {
        int x; cin >> x;
        s ^= x;
        f = 0;
        for (int j = 0; j < 30; ++j) 
            inc(f, (g[j][s >> j & 1 ^ 1] << j) % mod);
        for (int j = 0; j < 30; ++j) 
            inc(g[j][s >> j & 1], f);
    }
    cout << f << el;
}