#include<bits/stdc++.h>
using namespace std;


int main()
{
int N;
cin>>N;
vector<int>X(N);
for(int i=0;i<N;i++)
{cin>>X[i];}
vector<int>answers(100);
for(int i=0;i<100;i++)
{answers[i]=0;
for(int j=0;j<N;j++)
{answers[i]+=(i+1-X[j])*(i+1-X[j]);}
}
sort(answers.begin(),answers.end());
cout<<answers[0]<<endl;



}


### Prompt

Construct a Cpp code solution to the problem outlined:

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()
{
int N;
cin>>N;
vector<int>X(N);
for(int i=0;i<N;i++)
{cin>>X[i];}
vector<int>answers(100);
for(int i=0;i<100;i++)
{answers[i]=0;
for(int j=0;j<N;j++)
{answers[i]+=(i+1-X[j])*(i+1-X[j]);}
}
sort(answers.begin(),answers.end());
cout<<answers[0]<<endl;



}


```