Code Submission Evaluation System Login

CSES Problem Set

Subarray Divisibility


Task | Statistics


CSES - Subarray DivisibilityCSES - Subarray Divisibility

Time limit:1.00 s Memory limit:512 MB

Given an array of $n$ integers, your task is to count the number of subarrays where the sum of values is divisible by $n$.

Input

The first input line has an integer $n$: the size of the array.

The next line has $n$ integers $a_1,a_2,\dots,a_n$: the contents of the array.

Output

Print one integer: the required number of subarrays.

Constraints
Example

Input:
5
3 1 2 7 4


Output:
1