import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner kb = new Scanner(System.in);
		int n = kb.nextInt();
		int[] x = new int[n];
		for(int i = 0; i < n; i++) {
			x[i] = kb.nextInt();
		}
		
		
		int min = Integer.MAX_VALUE;
		for(int i = 0; i <= 100; i++) {
			int cost = 0;
			for(int j = 0; j < n; j++)
				cost += (x[j] - (i+1))*(x[j] - (i+1));
			min = Math.min(cost, min);
		}
		
		System.out.println(min);
	}
}

/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