import java.util.ArrayList;
import java.util.Scanner;
import java.util.TreeSet;

public class Main
{
	public static void main(String[] args)
	{
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int[] a = new int[n];
		for(int i = 0 ; i < n ; i++)
			a[i] = scanner.nextInt();
		int minStamina = (1 << 30);
		for(int p = 1, stamina ; p <= 100 ; p++)
		{
			stamina = 0;
			for(int i = 0 ; i < n ; i++)
				stamina += (a[i] - p) * (a[i] - p);
			minStamina = Math.min(minStamina, stamina);
		}
		System.out.println(minStamina);
		scanner.close();
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz