import java.util.*;

class Main{
    public static void sort(int[] x){
      for(int i = 0; i < x.length; i++){
        for(int j = i+1; j < x.length; j++){
          if(x[i] > x[j]){
            int  t = x[i];
            x[i] = x[j];
            x[j] = t;
          }
        }
      }
    }
    public static void main(String[] args) {
        Scanner stdIn = new Scanner(System.in);
        int n = stdIn.nextInt();
        int x[] = new int[n];
        double ave = 0;
        for(int i = 0; i < n; i++){
          x[i] = stdIn.nextInt();
          ave += x[i];
        }
        int p = 0;
        ave = ave/(double)n;
        if(ave*10 % 10 >= 5) p = (int)(ave+1);
        else p = (int)ave;

        int ans = 0;
        for(int i = 0; i < n; i++)
          ans += (x[i] - p) * (x[i] - p);

        System.out.println(ans);
    }
}
/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