大吉大利（算贡献）

#include <bits/stdc++.h>

using namespace std;
#define int long long
const int maxn = 1e5 + 5;
int n, a[maxn], x[35];
int ans;

signed main() {
    //freopen("in", "r", stdin);
    ios::sync_with_stdio();
    cin >> n;

    for (int i = 1; i <= n; i++)
        cin >> a[i];

    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 30; j++) {
            if (a[i] & (1 << j))
                x[j]++;
        }
    }
    for (int i = 0; i < 30; i++)
        ans += x[i] * x[i] * (1 << i);
    cout << ans;
    return 0;
}