import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        //消費コストが常に0以上なので、最小となるのは1から100の間　全探索すればいい
        int N=sc.nextInt();
        int[] X=new int[N];
        for(int i=0; i<N; i++){
            X[i] = sc.nextInt();
        }
        int max=Integer.MAX_VALUE;
        int tmp=0;
        for(int zahyo=1; zahyo<=100; zahyo++){
            tmp=0;
            for(int i=0; i<N; i++){
                tmp+=(zahyo-X[i])*(zahyo-X[i]);
            }
            max=Math.min(max,tmp);
        }
        pl(max);
    }
    public static void pl(Object o){
        System.out.println(o);
    }
    public static void p(Object o){
        System.out.println(o);
    }
}

/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