#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fr first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

mt19937 rng (chrono::steady_clock::now().time_since_epoch().count() );

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1e6 + 12; //check the limits, dummy

ll bit[64];

int main() {
    ios_base::sync_with_stdio (0);
    cin.tie (0);

    ll n;
    cin >> n;
    vl a (n);
    FOR (i, 0, n) cin >> a[i];

    FOR (i, 0, n) {
        FOR (j, 0, 64) {
            if (a[i] & (1LL << j) ) bit[j]++;
        }
    }

    ll ans = 0;
    FOR (i, 0, 64) {
        ll cnt = bit[i] * (n - bit[i]);
        ll val = (1LL << i);
        val %= MOD;
        ans = (ans + cnt * val % MOD) % MOD;
    }

    cout << ans << '\n';


    return  0;
}
