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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.*;

class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();

        int X[] = new int[N];
        int min = 100;
        int max = 0;

        for(int i=0;i<N;i++){
            X[i] = sc.nextInt();
            if(max < X[i])max = X[i];
            if(min > X[i])min = X[i];
        }
        sc.nextLine();
        
        double hp_all[] = new double[max - min];
        double hp_min = 1000000;
        for(int i=min;i<max;i++){
            for(int j=1;j<N;j++){
                hp_all[i-min] += Math.pow(X[j] - i, 2);
            }
            if(hp_min > hp_all[i-min])hp_min = hp_all[i-min];
        }
        System.out.println(hp_min);
    }
}