Increase and Decrease

Polycarpus has an array, consisting of n integers a₁, a₂, ..., a_n. Polycarpus likes it when numbers in an array match. That's why he wants the array to have as many equal numbers as possible. For that Polycarpus performs the following operation multiple times:

• he chooses two elements of the array a_i, a_j (i ≠ j);
• he simultaneously increases number a_i by 1 and decreases number a_j by 1, that is, executes a_i = a_i + 1 and a_j = a_j - 1.

The given operation changes exactly two distinct array elements. Polycarpus can apply the described operation an infinite number of times.

Now he wants to know what maximum number of equal array elements he can get if he performs an arbitrary number of such operation. Help Polycarpus.

Input

The first line contains integer n (1 ≤ n ≤ 10⁵) — the array size. The second line contains space-separated integers a₁, a₂, ..., a_n (|a_i| ≤ 10⁴) — the original array.

Output

Print a single integer — the maximum number of equal array elements he can get if he performs an arbitrary number of the given operation.

Example

Input

2
2 1

Output

1

Input

3
1 4 1

Output

3

题意：给出一个序列，进行操作，每次选取两个数字，一个+1一个-1，问最后最多能有多少个数字是相等的。比如样例2可以变成2 2 2，所以输出3.

题解：一个数字+1，一个数字-1，保证整个序列的和是一直不变的嘛，所以你需要判断是就是把这些数字加起来得到一个sum后，对n进行取余，如果余数位0，就说明大家可以分得刚刚好，最大值就是n，输出。如果不为0，就选出一个数字，你把sum全部加到这个数字上去好了，然后其他数字全部变为某个数，得到的最大值就是n-1.所以只有两种答案。

#include<stdio.h>
#define M 100010
int main()
{
    int n,i;
    long sum=0;
    int x[M];
    scanf("%d",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&x[i]);
        sum=sum+x[i];
    }
    if(sum%n==0)
    {
        n=n;
    }
    else n=n-1;
    printf("%d",n);
    return 0;
}