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

#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
#define ANS(ans) cout << (ans) << endl;
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
typedef vector<int> VI;
typedef pair<int, int> P;

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (long long i = 0; i < (n); ++i)

// modint: mod 計算を int を扱うように扱える構造体
template <int MOD>
struct Fp {
  long long val;
  constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
    if (val < 0) val += MOD;
  }
  constexpr int getmod() {
    return MOD;
  }
  constexpr Fp operator-() const noexcept {
    return val ? MOD - val : 0;
  }
  constexpr Fp operator+(const Fp& r) const noexcept {
    return Fp(*this) += r;
  }
  constexpr Fp operator-(const Fp& r) const noexcept {
    return Fp(*this) -= r;
  }
  constexpr Fp operator*(const Fp& r) const noexcept {
    return Fp(*this) *= r;
  }
  constexpr Fp operator/(const Fp& r) const noexcept {
    return Fp(*this) /= r;
  }
  constexpr Fp& operator+=(const Fp& r) noexcept {
    val += r.val;
    if (val >= MOD) val -= MOD;
    return *this;
  }
  constexpr Fp& operator-=(const Fp& r) noexcept {
    val -= r.val;
    if (val < 0) val += MOD;
    return *this;
  }
  constexpr Fp& operator*=(const Fp& r) noexcept {
    val = val * r.val % MOD;
    return *this;
  }
  constexpr Fp& operator/=(const Fp& r) noexcept {
    long long a = r.val, b = MOD, u = 1, v = 0;
    while (b) {
      long long t = a / b;
      a -= t * b;
      swap(a, b);
      u -= t * v;
      swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0) val += MOD;
    return *this;
  }
  constexpr bool operator==(const Fp& r) const noexcept {
    return this->val == r.val;
  }
  constexpr bool operator!=(const Fp& r) const noexcept {
    return this->val != r.val;
  }
  friend constexpr ostream& operator<<(ostream& os, const Fp<MOD>& x) noexcept {
    return os << x.val;
  }
  friend constexpr Fp<MOD> modpow(const Fp<MOD>& a, long long n) noexcept {
    if (n == 0) return 1;
    auto t = modpow(a, n / 2);
    t = t * t;
    if (n & 1) t = t * a;
    return t;
  }
};

const int MOD = 1000000007;
using mint = Fp<MOD>;

int main() {
  int n;
  cin >> n;

  vector<bitset<60>> v(n);
  VI zeros(60, 0);
  VI ones(60, 0);
  REP(i, n) {
    ll num;
    cin >> num;
    auto b = bitset<60>(num);
    REP(j, 60) {
      if (b[j]) {
        ones[j]++;
      } else {
        zeros[j]++;
      }
    }
  }

  mint ans = 0;
  REP(i, 60) {
    mint tmp = ones[i] * zeros[i];
    tmp *= pow(2, i);
    ans += tmp;
  }
  ANS(ans);
  return 0;
}
