#include <bits/stdc++.h>
using namespace std;
const long long INF = 9223372036854775807;
const long long N = 500005;
const long long mod = 998244353;
void ipgragh(long long n, long long m);
void start();
double epsilon = 2.718281828459045235360;
template <typename T>
void read(T &x) {
  cin >> x;
}
template <typename T, typename T0>
void read(T &x, T0 &y) {
  cin >> x >> y;
}
template <typename T, typename T0, typename T1>
void read(T &x, T0 &y, T1 &z) {
  cin >> x >> y >> z;
}
template <typename T, typename T0, typename T1, typename T2>
void read(T &x, T0 &y, T1 &z, T2 &w) {
  cin >> x >> y >> z >> w;
}
template <typename T>
void read(T oneD[], long long n) {
  for (long long i = 0; i < n; i++) {
    read(oneD[i]);
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  gcd(b, a % b);
}
double logvalue(double b, double n) {
  b = log(b);
  n = log(n);
  double p = (1.0 * n) / (1.0 * b);
  return p;
}
vector<long long> adj[N];
struct p {
  long long number, cost, index;
};
long long cases;
struct CompareHeight {
  bool operator()(struct p const &p1, struct p const &p2) {
    if (p1.cost == p2.cost) {
      return (p1.index > p2.index);
    }
    return (p1.cost > p2.cost);
  }
};
priority_queue<p, vector<p>, CompareHeight> Q;
void solve() {
  long long n;
  read(n);
  long long a[n];
  read(a, n);
  sort(a, a + n);
  long long ans = 0;
  for (long long(i) = 0; (i) <= (n / 2 - 1); (i) += (1)) {
    ans += (a[i] + a[n - i - 1]) * (a[i] + a[n - i - 1]);
  }
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  start();
  solve();
}
void start() {}
void ipgraph(long long n, long long m) {
  for (long long(i) = 0; (i) <= (m - 1); (i) += (1)) {
    long long l, r;
    read(l, r);
    adj[l].push_back(r);
    adj[r].push_back(l);
  }
}
