import java.util.Scanner;

public class Main {

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

		int people = sc.nextInt();
		long anser = 0;
		long max =  1000000000000000000l;
		int[] hp = new int[people];
		for(int num = 0 ; num <people; num++) {
			hp[num] = sc.nextInt();
		}
		//座標場所で一番最小のところ。
			for(int num = 0; num < 100; num++) {
				//最小を探すために毎回初期化
				anser = 0;
				for(int i = 0 ; i < people; i++) {
					//(x-p)2乗　公式
					//住人の座標-開催場所の座標
					anser +=(hp[i]-num) * (hp[i]-num);
				}
				if(max > anser) {
					max = anser;
				}
			}
		System.out.println(max);

	}
}

/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