#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
typedef unsigned long long ull;
typedef pair<int, int> PII;
mt19937 rng;
uniform_int_distribution <ull> dist(0,1ull<<63);
//#define mp make_pair
inline void print(__int128 x){//输出模板 
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9) print(x/10);
    putchar(x%10+'0');
}
inline int read()
{
    int X = 0;
    bool flag = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            flag = 0;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        X = (X << 1) + (X << 3) + ch - '0';
        ch = getchar();
    }
    if (flag)
        return X;
    return ~(X - 1);
}
const LL mod = 1e9 + 7,INF = 0x3f3f3f3f;
LL qpow(LL a, LL b)
{
    LL res = 1;
    a %= mod;
    assert(b >= 0);
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
    }
    return res;
}
inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
inline int lcm(int a, int b) { return a / gcd(a, b) * b; }
const int N = 300010,M = 1000010;

int f[N],a[N],val[70][2],tmp[70];

void solve()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>a[i];
    
    f[0] = 1;
    for(int i=1;i<=n;i++)
    {
        int t = a[i],idx = 0;
        for(int j=0;j<=60;j++) tmp[j] = 0;
        while(t)
        {
            tmp[idx++] = t%2;
            t >>= 1;
        }
        for(int j=0;j<=60;j++)
        {
            if(tmp[j])
            {
                swap(val[j][0],val[j][1]);
            }
        }
        for(int j=0;j<=60;j++) (val[j][tmp[j]] += f[i-1]) %= mod;
        for(int j=0;j<=60;j++) f[i] += (1<<j)*val[j][1]%mod,f[i] %= mod;
    }
    cout<<f[n]<<'\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin>>t;
    while (t--)
        solve();
    return 0;
}