Increase and Decrease

题意翻译

## 题意： 给定n个数，每次可以将其中不相同的两个数一个加1，一个减1。问你最多可以得到多少个相同的数。

题目描述

Polycarpus has an array, consisting of $ n $ integers $ a_{1},a_{2},...,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.

输入输出格式

输入格式

The first line contains integer $ n $ ( $ 1<=n<=10^{5} $ ) — the array size. The second line contains space-separated integers $ a_{1},a_{2},...,a_{n} $ ( $ |a_{i}|<=10^{4} $ ) — the original array.

输出格式

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

输入输出样例

输入样例 #1

2
2 1

输出样例 #1

1

输入样例 #2

3
1 4 1

输出样例 #2

3