#include <bits/stdc++.h>
using namespace std;

#define int long long

constexpr int mod = 1e9 + 7;

void solve() {
    int n;
    cin >> n;

    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        a[i] ^= a[i - 1];
    }

    vector<int> dp(n + 1);
    array<array<int, 2>, 61> sum {};
    for (int i = 0; i < 61; i++) {
        sum[i][0] = 1;
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 61; j++) {
            dp[i] = (dp[i] + sum[j][!(a[i] >> j & 1)] * (1LL << j) % mod) % mod;
        }
        for (int j = 0; j < 61; j++) {
            sum[j][a[i] >> j & 1] = (sum[j][a[i] >> j & 1] + dp[i]) % mod;
        }
    }
    cout << dp[n] << "\n";
}

signed main() {
    ios::sync_with_stdio(false); 
    cin.tie(nullptr);
    
    int t = 1;
    while (t--) {
        solve();
    }

    return 0;
}

/*
4
7 3 1 2
*/