import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        int N;
        int[] Xi = null;
        try (Scanner sc = new Scanner(System.in)) {
            N = sc.nextInt();
            Xi = new int[N];
            for (int i = 0; i < N; i++) {
                Xi[i] = sc.nextInt();
            }
        }

        int result = Integer.MAX_VALUE;
        for (int i = 0; i < 101; i++) {
            int temp = 0;
            for(int j : Xi){
                temp += Math.pow(Math.abs(i - j),2);
            }
            if(result > temp){
                result = temp;
            }
        }

        System.out.println(result);
    }
}

/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