Number of Ways

2000ms

262144K

Description:

You've got array a[1], a[2], ..., a[n], consisting of n integers. Count the number of ways to split all the elements of the array into three contiguous parts so that the sum of elements in each part is the same.

More formally, you need to find the number of such pairs of indices i, j (2 ≤ i ≤ j ≤ n - 1), that $\text{[math]}$ .

Input:

The first line contains integer n (1 ≤ n ≤ 5·10⁵), showing how many numbers are in the array. The second line contains n integers a[1], a[2], ..., a[n] (|a[i]| ≤ 10⁹) — the elements of array a.

Output:

Print a single integer — the number of ways to split the array into three parts with the same sum.

Sample Input:

5
1 2 3 0 3

Sample Output:

Sample Input:

4
0 1 -1 0

Sample Output:

Sample Input:

2
4 1

Sample Output:

Informação

Provedor Codeforces

Código CF466C