// https://atcoder.jp/contests/abc147/tasks/abc147_d
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define DIV(a, b) ((a - 1) / b + 1)

// template <int MOD> struct ModInt {
//     static const int Mod = MOD;
//     unsigned x;
//     ModInt() : x(0) {}
//     ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
//     ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD;
//     } int get() const { return (int)x; } ModInt &operator+=(ModInt that) {
//         if ((x += that.x) >= MOD)
//             x -= MOD;
//         return *this;
//     }
//     ModInt &operator-=(ModInt that) {
//         if ((x += MOD - that.x) >= MOD)
//             x -= MOD;
//         return *this;
//     }
//     ModInt &operator*=(ModInt that) {
//         x = (unsigned long long)x * that.x % MOD;
//         return *this;
//     }
//     ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
//     ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
//     ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
//     ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
//     ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
//     ModInt inverse() const {
//         long long a = x, b = MOD, u = 1, v = 0;
//         while (b) {
//             long long t = a / b;
//             a -= t * b;
//             std::swap(a, b);
//             u -= t * v;
//             std::swap(u, v);
//         }
//         return ModInt(u);
//     }
//     bool operator==(ModInt that) const { return x == that.x; }
//     bool operator!=(ModInt that) const { return x != that.x; }
//     ModInt operator-() const {
//         ModInt t;
//         t.x = x == 0 ? 0 : Mod - x;
//         return t;
//     }
// };
// template <int MOD> ostream &operator<<(ostream &st, const ModInt<MOD> a) {
//     st << a.get();
//     return st;
// };
// template <int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k)
// {
//     ModInt<MOD> r = 1;
//     while (k) {
//         if (k & 1)
//             r *= a;
//         a *= a;
//         k >>= 1;
//     }
//     return r;
// }
// typedef ModInt<1000000007> mint;

template <int mod> struct ModInt {
    int x;
    ModInt() : x(0) {}
    ModInt(long long x_) {
        if ((x = x_ % mod + mod) >= mod)
            x -= mod;
    }
    ModInt &operator+=(ModInt rhs) {
        if ((x += rhs.x) >= mod)
            x -= mod;
        return *this;
    }
    ModInt &operator-=(ModInt rhs) {
        if ((x -= rhs.x) < 0)
            x += mod;
        return *this;
    }
    ModInt &operator*=(ModInt rhs) {
        x = (unsigned long long)x * rhs.x % mod;
        return *this;
    }
    ModInt &operator/=(ModInt rhs) {
        x = (unsigned long long)x * rhs.inv().x % mod;
        return *this;
    }
    ModInt operator-() const { return -x < 0 ? mod - x : -x; }
    ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
    ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
    ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
    ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
    bool operator==(ModInt rhs) const { return x == rhs.x; }
    bool operator!=(ModInt rhs) const { return x != rhs.x; }
    ModInt inv() const { return pow(*this, mod - 2); }
    friend ostream &operator<<(ostream &s, ModInt<mod> a) {
        s << a.x;
        return s;
    }
    friend istream &operator>>(istream &s, ModInt<mod> &a) {
        s >> a.x;
        return s;
    }
};
using mint = ModInt<(int)1e9 + 7>;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    vector<int> v(N);
    for (auto &x : v) {
        cin >> x;
    }

    mint res = 0;
    REP(d, 60) {
        int n0 = 0, n1 = 0;
        for (auto &x : v) {
            if (x >> d & 1) {
                n1++;
            } else {
                n0++;
            }
        }
        mint msk = (1LL << d);
        res += msk * n0 * n1;
    }
    cout << res << endl;
    return 0;
}


Measured memory_bytes: 2560