import java.util.Scanner;

public class Main {

	public static int N;
	public static int[] X;

	public static void main(String[] args) {
		init();
		int min = 100 * 100 * 100;
		for (int p = 1; p <= 100; p++) {
			int sum = 0;
			for (int i = 0; i < N; i++) {
				sum += (X[i] - p) * (X[i] - p);
			}
			if (sum < min) {
				min = sum;
			}
		}
		System.out.println(min);
	}

	public static void init() {
		Scanner sc = new Scanner(System.in);
		try {
			N = sc.nextInt();
			X = new int[N];
			for (int i = 0; i < N; i++) {
				X[i] = sc.nextInt();
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}

/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