import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main
{
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static void main(String args[])
    {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    }
} import java.io.BufferedReader; BufferedReader java.io import java.io.IOException; IOException java.io import java.io.InputStreamReader; InputStreamReader java.io import java.util.StringTokenizer; StringTokenizer java.util import java.util.TreeSet; TreeSet java.util public class Main
{
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static void main(String args[])
    {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    }
} Main public static void main(String args[])
    {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    } main {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    } FastReader obj = new FastReader(); obj new FastReader() int n = obj.nextInt() n obj.nextInt() obj.nextInt obj min = Integer.MAX_VALUE min Integer.MAX_VALUE Integer Integer.MAX_VALUE max = Integer.MIN_VALUE max Integer.MIN_VALUE Integer Integer.MIN_VALUE arr[] = new int[n]; arr new int[n] n for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];} int i=0; int i=0; i 0 i<n i n i++ i++ i {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];} {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];} arr[i] = obj.nextInt() arr[i] arr i obj.nextInt() obj.nextInt obj if(min>arr[i])min = arr[i]; min>arr[i] min arr[i] arr i min = arr[i] min arr[i] arr i if(max<arr[i])max = arr[i]; max<arr[i] max arr[i] arr i max = arr[i] max arr[i] arr i TreeSet<Integer> data = new TreeSet<>(); data new TreeSet<>() for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        } int i=min; int i=min; i min i<=max i max i++ i++ i {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        } {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        } int sum =0; sum 0 for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i); int j=0; int j=0; j 0 j<n j n j++ j++ j sum += (arr[j]-i)*(arr[j]-i); sum += (arr[j]-i)*(arr[j]-i) sum (arr[j]-i)*(arr[j]-i) (arr[j]-i) arr[j] arr j i (arr[j]-i) arr[j] arr j i data.add(sum) data.add data sum System.out.println(data.first()) System.out.println System.out System System.out data.first() data.first data String args[] args static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    } FastReader BufferedReader br; br StringTokenizer st; st public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        } FastReader {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        } br = new BufferedReader(new
                    InputStreamReader(System.in)) br new BufferedReader(new
                    InputStreamReader(System.in)) String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        } next {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        } while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            } st == null || !st.hasMoreElements() st == null st null !st.hasMoreElements() st.hasMoreElements() st.hasMoreElements st {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            } try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                } catch (IOException e) {
                    e.printStackTrace();
                } IOException e {
                    e.printStackTrace();
                } e.printStackTrace() e.printStackTrace e {
                    st = new StringTokenizer(br.readLine());
                } st = new StringTokenizer(br.readLine()) st new StringTokenizer(br.readLine()) return st.nextToken(); st.nextToken() st.nextToken st int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next long nextLong() {
            return Long.parseLong(next());
        } nextLong {
            return Long.parseLong(next());
        } return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next double nextDouble() {
            return Double.parseDouble(next());
        } nextDouble {
            return Double.parseDouble(next());
        } return Double.parseDouble(next()); Double.parseDouble(next()) Double.parseDouble Double next() next String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        } nextLine {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        } String str = ""; str "" try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            } catch (IOException e) {
                e.printStackTrace();
            } IOException e {
                e.printStackTrace();
            } e.printStackTrace() e.printStackTrace e {
                str = br.readLine();
            } str = br.readLine() str br.readLine() br.readLine br return str; str public class Main
{
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static void main(String args[])
    {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    }
} public class Main
{
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static void main(String args[])
    {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    }
} Main
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main
{
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    public static void main(String args[])
    {
        FastReader obj = new FastReader();
        int n = obj.nextInt(),min = Integer.MAX_VALUE,max = Integer.MIN_VALUE,arr[] = new int[n];
        for(int i=0;i<n;i++) {arr[i] = obj.nextInt();if(min>arr[i])min = arr[i]; if(max<arr[i])max = arr[i];}
        TreeSet<Integer> data = new TreeSet<>();
        for(int i=min;i<=max;i++)
        {
            int sum =0;
            for(int j=0;j<n;j++)
                sum += (arr[j]-i)*(arr[j]-i);
            data.add(sum);
        }
        System.out.println(data.first());
    }
}
