#include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<(int)N;i++)
int main()
{
  int N,mean1=0,mean2=0,sum=0,y=0;
  cin>>N;
  vector<int> X(N,0);
  rep(i,N){cin>>X.at(i);sum+=X.at(i);}
  y=sum/N;
  rep(i,N){mean1+=pow(X.at(i)-y,2);mean2+=pow(X.at(i)-y-1,2);}
  cout<<min(mean1,mean2)<<endl;
}
### Prompt

Please create a solution in cpp 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;
#define rep(i,N) for(int i=0;i<(int)N;i++)
int main()
{
  int N,mean1=0,mean2=0,sum=0,y=0;
  cin>>N;
  vector<int> X(N,0);
  rep(i,N){cin>>X.at(i);sum+=X.at(i);}
  y=sum/N;
  rep(i,N){mean1+=pow(X.at(i)-y,2);mean2+=pow(X.at(i)-y-1,2);}
  cout<<min(mean1,mean2)<<endl;
}
```