/*
By Tianyi Chen. All rights reserved.
Date: 2016-08-13
*/
#include<bits/stdc++.h>
using namespace std;
int n,a[100],s,ans=INT_MAX;
int main() {
 scanf("%d",&n);for(int i=0;i<n;++i)scanf("%d",a+i);
 for(int t=-100;t<=100;++t) {
  s=0;
  for(int i=0;i<n;++i)s+=(t-a[i])*(t-a[i]);
  ans=min(ans,s);
 }
 printf("%d\n",ans);
}
### Prompt

Please provide a CPP coded solution to the problem described below:

Evi has N integers a_1,a_2,..,a_N. His objective is to have N equal integers by transforming some of them.

He may transform each integer at most once. Transforming an integer x into another integer y costs him (x-y)^2 dollars. Even if a_i=a_j (i≠j), he has to pay the cost separately for transforming each of them (See Sample 2).

Find the minimum total cost to achieve his objective.

Constraints

* 1≦N≦100
* -100≦a_i≦100

Input

The input is given from Standard Input in the following format:


N
a_1 a_2 ... a_N


Output

Print the minimum total cost to achieve Evi's objective.

Examples

Input

2
4 8


Output

8


Input

3
1 1 3


Output

3


Input

3
4 2 5


Output

5


Input

4
-100 -100 -100 -100


Output

0

### Response

```cpp
/*
By Tianyi Chen. All rights reserved.
Date: 2016-08-13
*/
#include<bits/stdc++.h>
using namespace std;
int n,a[100],s,ans=INT_MAX;
int main() {
 scanf("%d",&n);for(int i=0;i<n;++i)scanf("%d",a+i);
 for(int t=-100;t<=100;++t) {
  s=0;
  for(int i=0;i<n;++i)s+=(t-a[i])*(t-a[i]);
  ans=min(ans,s);
 }
 printf("%d\n",ans);
}
```