#include <bits/stdc++.h>
using namespace std;
template <int mod> struct ModInt {
    int val;
    ModInt() : val(0) {}
    ModInt(long long x) : val(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}
    ModInt &operator+=(const ModInt &p) {
        if ((val += p.val) >= mod) {
            val -= mod;
        }
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if ((val += mod - p.val) >= mod) {
            val -= mod;
        }
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        val = (int)(1LL * val * p.val % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
    ModInt operator-() const { return ModInt(-val); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    bool operator==(const ModInt &p) const { return val == p.val; }
    bool operator!=(const ModInt &p) const { return val != p.val; }
    ModInt inverse() const {
        int a = val, b = mod, u = 1, v = 0, t;
        while (b > 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(u -= t * v, v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n) const {
        ModInt ret(1), mul(val);
        while (n > 0) {
            if (n & 1)
                ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.val; }
    friend istream &operator>>(istream &is, ModInt &a) {
        long long t;
        is >> t;
        a = ModInt<mod>(t);
        return (is);
    }
    static int get_mod() { return mod; }
};
const int MOD = 1000000007; // if inv is needed, this shold be prime.
using modint = ModInt<MOD>;

vector<modint> fact, fact_inv, inv;
// init_nCk pre calculates fact[], fact_inv[], inv[] for combination
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = modint(1);
    fact_inv[0] = fact_inv[1] = modint(1);
    inv[1] = modint(1);
    for (int i = 2; i < SIZE; i++) {
        fact[i] = fact[i - 1] * modint(i);
        inv[i] = modint(0) - inv[MOD % i] * modint(MOD / i);
        fact_inv[i] = fact_inv[i - 1] * inv[i];
    }
}
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define ALL(obj) begin(obj), end(obj)
using ll = unsigned long long;
int main() {
    ll N;
    vector<ll> A;
    cin >> N;
    REP(i, N) {
        ll a;
        cin >> a;
        A.push_back(a);
    }

    modint ans = modint(0);
    REP(i, 63) {
        modint zc, oc;
        zc = oc = modint(0);
        REP(j, N) {
            if (A[j] % 2 == 0) {
                zc += 1;
            } else {
                oc += 1;
            }
            A[j] /= 2;
        }

        ans += zc * oc * modint(1LL << i);
    }

    cout << ans << endl;

    return 0;
}


Measured memory_bytes: 6000