#include<bits/stdc++.h>

using namespace std;

int main(){
	int n,s=0,i,j;
	int x[100];
	int min = INT_MAX;
	cin >> n;
	for(i=0;i<n;i++){
		cin >> x[i]; 
	}
	for (i=1;i<=100;i++){
		s = 0;
		for(j=0;j<n;j++){
			s += (x[j]-i)* (x[j]-i); 
		}
		if (s < min) min = s;
	}
	cout << min;
	return 0;
}

### 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,s=0,i,j;
	int x[100];
	int min = INT_MAX;
	cin >> n;
	for(i=0;i<n;i++){
		cin >> x[i]; 
	}
	for (i=1;i<=100;i++){
		s = 0;
		for(j=0;j<n;j++){
			s += (x[j]-i)* (x[j]-i); 
		}
		if (s < min) min = s;
	}
	cout << min;
	return 0;
}

```