#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define e1 first
#define e2 second
#define pb push_back
typedef pair <int, int> PII;
typedef unsigned int ui;
typedef unsigned long long int ull;
typedef long long int ll;
typedef double ld;
typedef pair <int, ll> PIL;
typedef pair <ll, int> PLI;
typedef pair <ll, ll> PLL;
const int mod = 1e9+7;
const int inf = 1e9+9;
const ll MOD = 1e9+696969;
const ll INF = ll(1e18) + 3;
#define maxn (1 << 17) + 7
#define maxpot 18
int n, a;
int tab[maxn], pot[maxn], start[maxn];
int dp[maxn];
ll wyn[maxn];
long long swyn;
int stab;
ll w;
void moduluj(int &a)
{
    while (a >= mod) a -= mod;
}
inline int readint()
{
    int x = 0; char zn;
    while (1)
    {
        zn = getchar();
        if (isspace(zn)) return x;
        x = (x << 1) + (x << 3) + zn - '0';
    }
}

void rec(int x, int j) {
    for (; j<17 && !(x & pot[j]); j++);
    if (j==17) {
        swyn += wyn[x];
        stab += start[x];
        return;
    }
    rec(x, j + 1);
    rec(x ^ pot[j], j + 1);
}


int main()
{
    n = readint();
    ll DUZO = mod;
    DUZO *= DUZO;
    pot[0] = 1;
    int maks = 0;
    for (int i=1; i<maxn; ++i) pot[i] = (pot[i-1] << 1), moduluj(pot[i]);

    for (int i=1; i<=n; ++i)
    {
        int a;
        a = readint();
        tab[a]++;
        start[a]++;
        maks = max(maks, a);
    }

    ll wynall = 0;
    wyn[0] = 1;
    for (int i=1; i<pot[17]; ++i)
    {
        swyn = stab = 0;
        rec(i, 0);
        swyn %= mod;
        tab[i] = stab;
        wyn[i] -= swyn;
        wyn[i] += pot[tab[i]];
        wyn[i] += mod;
        wyn[i] %= mod;
        ll w = i;
        ll POMOC = w * w * w  % mod;
        POMOC *= wyn[i];
        wynall += POMOC;
        wynall %= mod;
    }

    cout << wynall;
}