#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N = 3e5 + 10, mod = 1e9 + 7;

int n;
ll dp[N], a[N], s[65][2];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n;
    for (int i = 1, x; i <= n; i++) cin >> x, a[i] = a[i - 1] ^ x;
    dp[0] = 1;
    for (int i = 0; i <= 60; i++) s[i][0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= 60; j++) {
            dp[i] = (dp[i] + (1ll << j) % mod * s[j][!((a[i] >> j) & 1)] % mod) % mod;
        }
        for (int j = 0; j <= 60; j++) (s[j][(a[i] >> j) & 1] += dp[i]) %= mod;
    }
    cout << dp[n];
    return 0;
}