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# (Mono 4.6.2.0) (judge verdict: Accepted)


#if TEST
using Microsoft.VisualStudio.TestTools.UnitTesting;
using Newtonsoft.Json;
#endif

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.Linq;

namespace at_coder
{
#if TEST
    [TestClass]
#endif
    public class Test_156_c
    {
        
#if TEST
        public static void Test_Main()
#else
        public static void Main()
#endif
        {
            int N = ReadInt();
            int []ar = ReadIntArray();

            int maxAR = ar.Max();
            int minAR = ar.Min();

            int minDiff = CalcSum(ar, minAR);
            for(int p = minAR + 1; p <= maxAR; p++)
            {
                int diff = CalcSum(ar, p);
                if (diff < minDiff)
                {
                    minDiff = diff;
                }
            }

            Console.WriteLine(minDiff.ToString());
        }

        private static int CalcSum(int[] ar, int p)
        {
            int s = 0;
            for(int i = 0;i<ar.Length;i++)
            {
                s += (ar[i] - p) * (ar[i] - p);
            }

            return s;
        }

        static int Solve(int H, int A)
        {
            int d = H / A;
            int m = H % A;
            if (m > 0)
            {
                d++;
            }

            return d;
        }


        private static int ReadInt()
        {
            return int.Parse(Console.ReadLine());
        }

        private static int[] ReadIntArray()
        {
            string[] ss = Console.ReadLine().Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
            int[] ar = new int[ss.Length];
            for (int i = 0; i < ss.Length; i++)
            {
                ar[i] = int.Parse(ss[i]);
            }
            return ar;
        }

#if TEST
#else
    }
}
#endif