Contest Duration: - (local time) (100 minutes) Back to Home
C - Rally /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

i 番目の人が住んでいるのは座標 X_i です。

あなたは N 人全員が参加する集会を開くことを考えています。

N 人が消費する体力の総和としてありえる値の最小値を求めてください。

### 制約

• 入力は全て整数である。
• 1 \leq N \leq 100
• 1 \leq X_i \leq 100

### 入力

N
X_1 X_2 ... X_N


### 出力

N 人が消費する体力の総和としてありえる値の最小値を出力せよ。

### 入力例 1

2
1 4


### 出力例 1

5


### 入力例 2

7
14 14 2 13 56 2 37


### 出力例 2

2354


Score : 300 points

### Problem Statement

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.

### Sample Input 1

2
1 4


### Sample Output 1

5


Assume the meeting is held at coordinate 2. In this case, the first person will spend (1 - 2)^2 points of stamina, and the second person will spend (4 - 2)^2 = 4 points of stamina, for a total of 5 points of stamina. This is the minimum total stamina that the 2 people have to spend.

Note that you can hold the meeting only at an integer coordinate.

### Sample Input 2

7
14 14 2 13 56 2 37


### Sample Output 2

2354