import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto A = aryread!ulong();
    ulong ans;
    long[62][2] cnt;
    foreach (ulong i; 0 .. 61)
    {
        foreach (j; 0 .. N)
        {
            cnt[(A[j] & (1UL << i)) != 0][i]++;
        }
    }
    foreach (ulong i; 0 .. 61)
    {
        foreach (j; 0 .. N)
        {
            ans += ((1UL << i) % MOD) * cnt[(A[j] & (1UL << i)) == 0][i];
            ans %= MOD;
        }
    }
    writeln(ans * invmod!ulong(2) % MOD);
}

// x^^n % m
T powmod(T = long)(T x, T n, T m = 10 ^^ 9 + 7)
{
    if (n < 1)
        return 1;
    if (n & 1)
    {
        return x * powmod(x, n - 1, m) % m;
    }
    T tmp = powmod(x, n / 2, m);
    return tmp * tmp % m;
}

T invmod(T = long)(T x, T m = 10 ^^ 9 + 7)
{
    return powmod(x, m - 2, m);
}
