#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
const int mod2 = 998244353;
long long exp(long long taban, long long us, long long md) {
  long long carpan = taban % md;
  if (carpan == 0) return 0;
  long long temp = us;
  long long res = 1;
  while (temp) {
    if (temp % 2) res = (res * carpan) % md;
    temp /= 2;
    carpan = (carpan * carpan) % md;
  }
  return res;
}
long long ebob(long long a, long long b) {
  if (!a) return b;
  return ebob(b % a, a);
}
long long ekok(long long a, long long b) { return (a * b) / ebob(a, b); }
long long mul(long long a, long long b, long long md) { return a * b % md; }
vector<long long> fact;
vector<long long> inv_fact;
void fact_init(int n) {
  fact.resize(n + 5);
  inv_fact.resize(n + 5);
  fact[0] = inv_fact[0] = 1;
  for (int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    inv_fact[i] = exp(fact[i], mod - 2, mod);
  }
}
long long komb(long long a, long long b) {
  if (a < b) return 0;
  return fact[a] * (inv_fact[a - b] * inv_fact[b] % mod) % mod;
}
const int N = 5e4 + 5;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  vector<long long> vec(n);
  vector<int> cnt(30, 0);
  for (auto &x : vec) {
    cin >> x;
    int birler = 0;
    for (int i = 0; i < 30; i++) {
      if (x & (1ll << i)) cnt[i]++;
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    long long tmp = 0;
    for (int j = 0; j < 30; j++) {
      tmp += (1ll << j) * (cnt[j] > 0);
      cnt[j] = max(cnt[j] - 1, 0);
    }
    ans += tmp * tmp;
  }
  cout << ans << endl;
}
