import java.util.Scanner;

/**
 * TITLE : Rally URL
 * https://atcoder.jp/contests/abc156/tasks/abc156_c
 */
public class Main {

    public static void main(String args[]) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] X = new int[N];
        int min = 100;
        int max = 0;
        int sum = 0;
        for (int i = 0; i < N; i++) {
            X[i] = sc.nextInt();
            sum += X[i];
            min = min > X[i] ? X[i] : min;
            max = max < X[i] ? X[i] : max;
        }

        long P = Math.round((double) sum / X.length);
        int answer = 0;
        for (int i = 0; i < X.length; i++) {
            answer += (X[i] - P) * (X[i] - P);
        }
        System.out.println(answer);
        sc.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