Problem:
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

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>

int main(void)
{
    int N;      //参加人数
    int X[100]; //参加人数の座標
    int i, max_coordinate = 0;
    int consumed_energy, at_point;
    int sum[100], min;

    // input the data
    scanf("%d", &N);
    for (i = 0; i < N; i++)
    {
        scanf("%d", &X[i]);
    }

    // find max coordinate
    for (i = 0; i < N; i++)
    {
        if (max_coordinate < X[i])
            max_coordinate = X[i];
    }
    // printf("max = %d\n", max_coordinate);

    for (i = 0; i < 100; i++)
    {
        sum[i] = 0;
    }

    //
    for (at_point = 1; at_point <= max_coordinate; at_point++)
    {
        consumed_energy = 0;
        for (i = 0; i < N; i++)
        {
            consumed_energy = (X[i] - at_point) * (X[i] - at_point);
            sum[at_point - 1] += consumed_energy;
        }
    }

    // for (i = 0; i < max_coordinate; i++)
    // {
    //     printf("sum[%d] = %d\n", i, sum[i]);
    // }

    // find minimum sum
    min = sum[0];
    for (i = 0; i < max_coordinate; i++)
    {
        if (min > sum[i])
            min = sum[i];
    }
    printf("%d", min);
    return (0);
}