#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 3e5+5;
ll MOD = 1e9 + 7;
ll bitsum[MAXN][63][2];
int32_t main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector <ll> pow2(63, 0);
    pow2[0] = 1;
    for(int i = 1; i <= 62; i++) pow2[i] = pow2[i - 1] * 2;
    vector <ll> a(n + 1);
    vector <ll> xp(n + 1, 0);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        xp[i] = a[i] ^ xp[i - 1];
    } 
    vector <ll> dp(n + 1, 0);
    dp[1] = a[1];
    for(int j = 0; j < 63; j++) {
        if(pow2[j] & xp[1]) {
            bitsum[1][j][1] = (bitsum[1][j][1] + dp[1]) % MOD;
        }
        else {
            bitsum[1][j][0] = (bitsum[1][j][0] + dp[1]) % MOD;
        }
    }

    for(int i = 2; i <= n; i++) {
        for(int j = 0; j < 63; j++) {
            if(pow2[j] & xp[i]) {
                dp[i] = (dp[i] + bitsum[i - 1][j][0] * pow2[j]) % MOD;
                // cout << j <<  " " << bitsum[i - 1][j][0] << endl;                
            }
            else {
                dp[i] = (dp[i] + bitsum[i - 1][j][1] * pow2[j]) % MOD;
                // cout << j << " " << bitsum[i - 1][j][1] << endl;                
            }

        }
        dp[i] = (dp[i] + xp[i]) % MOD;
        for(int j = 0; j < 63; j++) {
            bitsum[i][j][1] = bitsum[i - 1][j][1];
            bitsum[i][j][0] = bitsum[i - 1][j][0];
            if(pow2[j] & xp[i]) {
                bitsum[i][j][1] = (bitsum[i][j][1] + dp[i]) % MOD;
            }
            else {
                bitsum[i][j][0] = (bitsum[i][j][0] + dp[i]) % MOD;
            }
        }
        // cout << i << " " << dp[i] << endl;
    }

    cout << dp[n] << endl;
}



/*



*/