#include <bits/stdc++.h>
using namespace std;

typedef long long  ll;
typedef pair <ll,ll>  pii;
typedef long double lf;

#define ff  first
#define ss  second
#define pb  push_back

const ll N = 3e5 + 5;
const ll M = 2e4;
const ll oo = 1e16 + 7;
const ll cm = 5e15;
const lf eps = 1e-9;
const ll mod = 1e9 + 7;

ll psum[60][N];
ll curr[60][2];

int main() {
  #ifdef LOCAL
  freopen("input.txt","r",stdin);
  #endif // LOCAL

  int n; cin >> n;
  vector <ll> a(n);
  for (auto &e : a) cin >> e;

  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < 60; ++j) psum[j][i + 1] = psum[j][i];
    for (int j = 0; j < 60; ++j) {
      if (a[i] & (1ll<<j)) psum[j][i + 1]++;
    }
  }

  vector <ll> dp(n + 1, 0);
  dp[n] = 1;
  for (int i = n - 1; i >= 0; --i) {
    dp[i] = (1ll * a[i] * dp[i + 1]) % mod;
    for (int j = 0; j < 60; ++j) {
      int vv = curr[j][psum[j][i] ^ 1];
      int vv2 = (1ll << j) % mod;
      dp[i] = (1ll * dp[i] + 1ll * vv * vv2) % mod;
    }
    for (int j = 0; j < 60; ++j)
      curr[j][psum[j][i + 1] & 1] = (curr[j][psum[j][i + 1] & 1] + dp[i + 1]) % mod;
  }

  cout << dp[0] << '\n';

  return 0;
}