Number of Ways

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 .

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.

Example

Input

5
1 2 3 0 3

Output

2

Input

4
0 1 -1 0

Output

1

Input

2
4 1

Output

0

这道题目时间卡的比较紧，二重循环一般是过不了的

如图所示：

只要保证其中两段的大小位sum/3，就可以保证剩余一段的大小也为sum/3

那么，为了方便取首尾两端，先从前向后记录和为sum/3的位置i（有序）

然后，从后向前找到 和为sum/3的位置j，二分查找小于j-1的i的数目，循环下来所得到的和就是所求的解

注意结果会超int

lower_bound( , , )可以返回指针或是迭代器

#include<cstdio>
#include<vector>
using namespace std;

int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		int an[500005];
		long long sum=0,si=0,sj=0,cnt=0,ave;
		vector <int> fr;
		for(int i=0;i<n;i++)
		{
			scanf("%lld",&an[i]);
			sum+=an[i];
		}
		if(n<3||sum%3!=0)
		{
			printf("0\n");
			continue;
		}
		ave=sum/3;
		for(int i=0;i<n-2;i++)
		{
			si+=an[i];
			if(si==ave)
				fr.push_back(i);			
		}
		for(int i=n-1;i>1;i--)
		{
			sj+=an[i];
			if(sj==ave)
			{
				cnt+=lower_bound(fr.begin(),fr.end(),i-1)-fr.begin();
			}			
		}
		printf("%lld\n",cnt);
	}
	return 0;
 }