#include <iostream>
#include <vector>
#include<math.h>

using namespace std;
int jump(int cur, vector<int>& v, vector<int>& visited) {
    int n = v.size(); int index;
    int sub = 0;
    for (int i = 0; i < n; i++) {
        if (!visited[i] && abs(v[i] - cur) > sub) {
            index = i;
            sub = abs(v[i] - cur);
        }
    }
    return index;
}

int main(){
    int n,res=0;
    cin >> n;
    vector<int> v(n);
    vector<int>visited(n, 0);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int cur = 0;
    for (int i = 0; i < n; i++) {
        int index=jump(cur, v, visited);
        res += (pow(v[index] - cur, 2));
        visited[index] = 1;
        cur= v[index];
    }
    cout<<res<<endl;
    return 0;
}