#include<stdio.h>

int main(){
  int total,i,j,N,min;min=10000000;total=0;
  scanf("%d",&N);
  int X[N];
  for(i=0;i<N;i++){
    scanf("%d",&X[i]);
  }
  for(i=1;i<101;i++){
    for(j=0;j<N;j++){
      total+=(X[j]-i)*(X[j]-i);
    }
    if(min>total)min=total;
    total=0;
  }
  printf("%d\n",min);
  return 0;
}
### Prompt

Develop a solution in CPP to the problem described below:

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<stdio.h>

int main(){
  int total,i,j,N,min;min=10000000;total=0;
  scanf("%d",&N);
  int X[N];
  for(i=0;i<N;i++){
    scanf("%d",&X[i]);
  }
  for(i=1;i<101;i++){
    for(j=0;j<N;j++){
      total+=(X[j]-i)*(X[j]-i);
    }
    if(min>total)min=total;
    total=0;
  }
  printf("%d\n",min);
  return 0;
}
```