#include<bits/stdc++.h>
using namespace std;
int main(){
	long long n,awa[1145]= {0},h,gao=-141,di=114514;cin >>n;
	for(int i = 0;i < n;i++){
		cin >> awa[i];
		gao = max(gao,awa[i]);
		di = min(di,awa[i]);
	}
	h = (gao - di - 17) / 2;
	gao -= h;di += h;
	long long sum = 0;
	for(int i = 0;i < n;i++){
		if(awa[i] < di){
			sum += pow((awa[i] - di),2);
		}
		if(awa[i] > gao){
			sum += pow((awa[i]-gao),2);
		}
	}
	cout << sum;
	return 0;
}

求大佬修改