Problem Setter: Khondokar Tanbir Ahmed

Intake 35, Department of CSE

Let you have N (0 < N < 101) integers, a₁, a₂, a₃, ..., a_N.

Your objective is to have N equal integers by transforming some of them.
You may transform each integer at most once. Transforming an integer x into another integer y costs you (x-y)² taka.

Find the minimum total cost to achieve your objective.

Input Format

The first line of the input contains an integer number N.

The second line contains N space-separated integers a1, a2, a3, ..., a_N (-101 < a_i < 101).

Output Format

Print the minimum total cost to achieve the objective.

Samples