import java.util.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int count = sc.nextInt();
        int[] point = new int[count];
        for(int index = 0; index < count; index++) {
          point[index] = sc.nextInt();
        }
      
        Arrays.sort(point);
        int min = point[0];
        int max = point[count - 1];
        int answer = Integer.MAX_VALUE;
        for(int n = min; n <= max; n++) {
          int total = 0;
          for(int p : point) {
            total += (int)StrictMath.pow(n - p, 2);
          }
          if(answer > total) {
            answer = total;
          }
        }
        System.out.println(answer);
    }
}
/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