#include <iostream>
#include <cmath>
using namespace std;
int main(int argc, char *argv[]) {
	int n,a=0,b=0; cin>>n;
	for(int i=1;i<=n;++i){
		int x; cin>>x;
		a+=x;
		b+=(x*x);
	}
	float t=a*1.0/n;
	int k=floor(t);
	if(t-k>=0.5) cout<<n*(k+1-t)*(k+1-t)+b-a*a*1.0/n<<endl;
	else cout<<n*(k-t)*(k-t)+b-a*a*1.0/n<<endl;
}
### Prompt

Your challenge is to write 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 <iostream>
#include <cmath>
using namespace std;
int main(int argc, char *argv[]) {
	int n,a=0,b=0; cin>>n;
	for(int i=1;i<=n;++i){
		int x; cin>>x;
		a+=x;
		b+=(x*x);
	}
	float t=a*1.0/n;
	int k=floor(t);
	if(t-k>=0.5) cout<<n*(k+1-t)*(k+1-t)+b-a*a*1.0/n<<endl;
	else cout<<n*(k-t)*(k-t)+b-a*a*1.0/n<<endl;
}
```