#include <bits/stdc++.h>
using namespace std;
char ca;
const int MOD = 1000000007;
long long c, d = 0, e, n, i, j, k, h, w, o, a[100005], b[10000] = {};
queue<long long> q;
string s;
pair<long long, long long> p[20][20];
vector<long long> v;
const int MAX = 2005;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  cin >> n;
  long long ma = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ma = max(a[i], ma);
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 60; j++) {
      if (a[i] & (1 << j)) b[j]++;
    }
  }
  for (int i = 0; i < 60; i++) {
    c = (1 << i);
    if (c > ma) break;
    c = c % MOD;
    k = b[i] * (n - b[i]) % MOD;
    d = (d + c * k) % MOD;
    cout << b[i] << " " << c << " " << d << "\n";
  }
  cout << d;
  return 0;
}
