#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n, h[305], ans = 0;
int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        scanf("%d", &h[i]);
    sort(h + 1, h + n + 1);
    int q = 0, p = n;
    while(q < p)
    {
        ans += pow((h[p]-h[q]), 2);
        q++;
        ans += pow((h[q]-h[p]), 2);
        p--;
    }
    cout << ans;
    return 0;
}