import java.util.Scanner;
  public class Main{
    public static void main(String args[]){
      Scanner sc = new Scanner(System.in);
      int N = sc.nextInt();
      int Max = 0;
      int sum1 = 0;
      int sum2 = 0;
      int[] X = new int[N];

      for(int i=0;i<N;i++){
        X[i] = sc.nextInt();
        if(Max<X[i]){
          Max=X[i];
        }
      }
      sc.close();
      sum1 = pow(1,N,X);
      for(int j=2;j<=Max;j++){
          sum2 = pow(j,N,X);
          if(sum1>sum2){
            sum1=sum2;
          }
      }
      System.out.println(sum1);
    }
    private static int pow(int n1,int N,int array[]){
      int sum = 0;
      for(int k=0;k<N;k++){
        sum+=Math.pow(array[k]-n1,2);
      }
      return sum;
    }
  }
/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