#include<bits/stdc++.h>

#define maxn 100005

#define mod 1000000007

using namespace std;

typedef long long LL;

int n, r, tot;

bool vis[maxn];

vector<LL> vec;

LL a[maxn], b[], other[], tmp[];

LL qpow(LL x, int n) {

    LL res = ;

    while(n) {

        if(n & ) res = res * x % mod;

        x = x * x % mod;

        n >>= ;

    }

    return res;

}

bool ins(LL x, LL base[]) {

    for(int i = ; i >= ; --i) {

        if(x & (1LL << i)) {

            if(base[i]) x ^= base[i];

            else {

                base[i] = x;

                return true;

            }

        }

    }

    return false;

}

int main() {

    while(~scanf("%d", &n)) {

        r = tot = ;

        vec.clear();

        for(int i = ; i <= ; ++i) b[i] = other[i] = ;

        for(int i = ; i <= n; ++i) {

            scanf("%lld", &a[i]);

            vis[i] = ;

            if(ins(a[i], b)) vis[i] = , ++r, vec.emplace_back(a[i]);

        }

        if(r == n) {

            printf("0\n");

            continue;

        }

        LL ans = qpow(, n - r - ) * (n - r) % mod;;

        for(int i = ; i <= n; ++i) {

            if(vis[i]) continue;

            ins(a[i], other);

        }

        for(int i = ; i < vec.size(); ++i) {

            tot = ;

            for(int j = ; j <= ; ++j) tmp[j] = ;

            for(int j = ; j < vec.size(); ++j) {

                if(i == j) continue;

                if(ins(vec[j], tmp)) ++tot;

            }

            for(int j = ; j <= ; ++j) {

                if(other[j] && ins(other[j], tmp)) ++tot;

            }

            if(!ins(vec[i], tmp)) {

                ans = (ans + qpow(, n - tot - )) % mod;

            }

        }

        printf("%lld\n", ans);

    }

    return ;

}