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

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

    Arrays.sort(x);
    int x_min = x[0];
    int x_max = x[n-1];

    //nが最大でも100なので全探索でやる
    int move_min = Integer.MAX_VALUE;
    for(int j=x_min; j<=x_max; ++j) {
      int move_sum = 0;
      for(int i=0; i<n; ++i) {
        move_sum += (x[i] - j) * (x[i] - j);
      }
      if(move_sum <= move_min) {
        move_min = move_sum;
      }
    }
    System.out.println(move_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