#include<bits/stdc++.h>
using namespace std;
int main(){
long long i,j,k,l,m,n,p;
while(cin>>p){
long long x[p];
for(i=0;i<p;i++)cin>>x[i];
sort(x,x+p);m=10000000000000000;
for(j=x[0];j<=x[p-1];j++)
{ k=0;
    for(i=0;i<p;i++){
l=abs(x[i]-j);
k+=(l*l);
}
    if(k<m) m=k;
}
cout<<m<<endl;
}
 return 0;
}

### Prompt

Please formulate a CPP solution to the following problem:

There are N people living on a number line.

The i-th person lives at coordinate X_i.

You are going to hold a meeting that all N people have to attend.

The meeting can be held at any integer coordinate. If you choose to hold the meeting at coordinate P, the i-th person will spend (X_i - P)^2 points of stamina to attend the meeting.

Find the minimum total points of stamina the N people have to spend.

Constraints

* All values in input are integers.
* 1 \leq N \leq 100
* 1 \leq X_i \leq 100

Input

Input is given from Standard Input in the following format:


N
X_1 X_2 ... X_N


Output

Print the minimum total stamina the N people have to spend.

Examples

Input

2
1 4


Output

5


Input

7
14 14 2 13 56 2 37


Output

2354

### Response

```cpp
#include<bits/stdc++.h>
using namespace std;
int main(){
long long i,j,k,l,m,n,p;
while(cin>>p){
long long x[p];
for(i=0;i<p;i++)cin>>x[i];
sort(x,x+p);m=10000000000000000;
for(j=x[0];j<=x[p-1];j++)
{ k=0;
    for(i=0;i<p;i++){
l=abs(x[i]-j);
k+=(l*l);
}
    if(k<m) m=k;
}
cout<<m<<endl;
}
 return 0;
}

```