#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 100005
const ll mod = 1e9 + 7;
ll n, a[MAXN], pw[MAXN];
// 一个数 n
// 若干个数 无1 min-1
// 若干个数 x个1 (x & 1)
ll cnt = 0, b[65];
void ins(ll x) {
    cnt++;
    for(int i=59;i>=0;i--) if(x & (1ll<<i)) {
        if(b[i]) x ^= b[i];
        else {b[i] = x; cnt--; break;}
    }
}
ll query(ll x) {
    for(int i=59;i>=0;i--) if(x & (1ll<<i)) x ^= b[i];
    if(x) return 0;
    return pw[cnt];
}
int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    cin>>n;
    // n = 1000;
    ll sum = 0, ans = 0;
    pw[0] = 1;
    for(int i=1;i<=n;i++) {
        cin>>a[i];
        // a[i] = i;
        sum ^= a[i], pw[i] = pw[i-1] * 2 % mod;
    }
    sort(a+1, a+1+n);
    if(sum == 0) ans = n+1;
    int tot = 0;
    for(int i=n;i>=1;i--) {
        if(a[i] > 1) {
            sum ^= a[i];
            ans = (ans + query(sum ^ (a[i]-1))) % mod;
            // if((sum ^ (a[i]-1)) == 0) ans = (ans + mod-1) % mod;
            ins(a[i]);
        }else {
            tot++;
        }
    }
    if(n == 1000) printf("sum = %lld\n", sum);
    if(tot == n) {cout << pw[tot] << '\n'; return 0;}
    sum = 0;
    for(int i=1;i<=n;i++) sum ^= a[i];
    for(int i=1;i<=n;i++) if(sum == a[i]-1) ans = (ans + mod-1) % mod;
    ans = (ans + query(sum ^ 1) * (pw[tot]+mod-1)) % mod;
    cout << ans << '\n';
    return 0;
}

/*

{1, 2} = 0

{2} = 2
*/