#include <bits/stdc++.h>
using namespace std;
template <class T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <class T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
bool prime[100005];
void SieveOfEratosthenes(long long int n) {
  memset(prime, true, sizeof(prime));
  for (long long int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      for (long long int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
bool isPrime(long long int n) {
  if (n < 2) return false;
  for (long long int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
std::vector<long long int> generatePrimeFactors(long long int n) {
  std::vector<long long int> prime;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      prime.push_back(i);
      while (n % i == 0) n = n / i;
    }
  }
  if (n != 1) prime.push_back(n);
  return prime;
}
std::vector<long long int> generateFactors(long long int n) {
  std::vector<long long int> fact;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      fact.push_back(i);
      if (n / i != i) fact.push_back(n / i);
    }
  }
  fact.push_back(1);
  sort(fact.begin(), fact.end());
  return fact;
}
long long int gcd(long long int a, long long int b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long int mulmod(long long int a, long long int b, long long int mod) {
  return ((a % mod) * (b % mod)) % mod;
}
long long int modpow(long long int x, long long int n, long long int m) {
  if (n == 0) return 1 % m;
  long long int u = modpow(x, n / 2, m) % m;
  u = ((u % m) * (u % m)) % m;
  if (n % 2 == 1) u = ((u % m) * (x % m)) % m;
  return u % m;
}
long long int eulerstotientfunction(long long int n) {
  long long int ans = n;
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      while (n % i == 0) n = n / i;
      ans -= ans / i;
    }
  }
  if (n > 1) ans -= ans / n;
  return ans;
}
long long int modinverse(long long int x, long long int m) {
  return modpow(x, m - 2, m);
}
long long int ncr(long long int n, long long int k) {
  if (k > n) return 0;
  long long int res = 1;
  k = min(k, n - k);
  for (long long int i = 1; i <= k; i++) {
    res *= (n - i + 1);
    res /= i;
  }
  return res;
}
long long int kadaneAlgo(const std::vector<long long int> &arr) {
  long long int size = arr.size();
  long long int currmax = arr[0], maxsofar = arr[0];
  for (long long int i = 1; i < size; i++) {
    currmax = max(arr[i], currmax + arr[i]);
    maxsofar = max(maxsofar, currmax);
  }
  return maxsofar;
}
std::vector<long long int> zAlgo(string str) {
  std::vector<long long int> z(str.length());
  long long int n = str.length(), left = 0, right = 0;
  z[0] = 0;
  for (long long int i = 1; i < n; i++) {
    if (i > right) {
      left = right = i;
      while (right < n && str[right] == str[right - left]) right++;
      z[i] = right - left;
      right--;
    } else {
      long long int k = i - left;
      if (z[k] < right - i + 1)
        z[i] = z[k];
      else {
        left = i;
        while (right < n && str[right] == str[right - left]) right++;
        z[i] = right - left;
        right--;
      }
    }
  }
  return z;
}
long long int getDigitSum(long long int n) {
  long long int co = 0;
  while (n > 0) {
    co += n % 10;
    n = n / 10;
  }
  return co;
}
void decrease(string &str) {
  long long int i = str.length() - 1;
  while (i > 0 && str[i] == '0') {
    str[i] = '9';
    i--;
  }
  str[i] = str[i] - 1;
}
template <class T>
void printVector(const std::vector<T> arr) {
  for (auto i : arr) cout << i << '\n';
}
void printArray(long long int arr[], long long int n) {
  for (long long int i = 0; i < n; i++) cout << arr[i] << " ";
  cout << '\n';
}
int main() {
  long long int t = 1;
  long long int cases = t;
  while (t--) {
    long long int n;
    cin >> n;
    std::vector<long long int> arr(n);
    for (long long int i = 0; i < n; i++) cin >> arr[i];
    long long int ans = 0;
    for (long long int i = 0; i < 60; i++) {
      long long int one = 0, zero = 0;
      if (arr[0] & (1LL << i))
        one++;
      else
        zero++;
      for (long long int j = 1; j < n; j++) {
        long long int tempone = 0, tempzero = 0;
        if (arr[j] & (1LL << i))
          tempone++;
        else
          tempzero++;
        if (tempone)
          ans = ((ans % 1000000007) +
                 (zero * modpow(2, i, 1000000007)) % 1000000007) %
                1000000007;
        else if (tempzero)
          ans = ((ans % 1000000007) +
                 (one * modpow(2, i, 1000000007)) % 1000000007) %
                1000000007;
        zero += tempzero;
        one += tempone;
      }
    }
    cout << ans % 1000000007 << '\n';
  }
  return 0;
}
