Array Division

                                 C. Array Division
                           time limit per test:2 seconds
                         memory limit per test:256 megabytes
                                 inputstandard: input
                                outputstandard: output

Vasya has an array a consisting of positive integer numbers. Vasya wants to divide this array into two non-empty consecutive parts (the prefix and the suffix) so that the sum of all elements in the first part equals to the sum of elements in the second part. It is not always possible, so Vasya will move some element before dividing the array (Vasya will erase some element and insert it into an arbitrary position).

Inserting an element in the same position he was erased from is also considered moving.

Can Vasya divide the array after choosing the right element to move and its new position?

Input
The first line contains single integer n (1 ≤ n ≤ 100000) — the size of the array.

The second line contains n integers a1, a2… an (1 ≤ ai ≤ 109) — the elements of the array.

Output

Print YES if Vasya can divide the array after moving one element. Otherwise print NO.

Examples

input
3
1 3 2

output
YES

input
5
1 2 3 4 5

output
NO

input
5
2 2 3 4 5

output
YES

Note

In the first example Vasya can move the second element to the end of the array.

In the second example no move can make the division possible.

In the third example Vasya can move the fourth element by one position to the left.

题意：问可不可以移动一串数字中一个数字的位置，使得可以将序列分成两段相等的序列？

思路：首先枚举截断的位置，这样我们需要移动的数就是前后两段序列和的差的二分之一的那个数，只需要查找前后序列有没有这个数就好，这里需要用STL中的set实现O(logN)的查询，否则会超时；需要注意的是，可能是从前面序列往后拿数字，也可能是从后面序列往前拿数字，这样就需要做两遍。另外枚举截断位置的边界需要到n，因为可能是从中取出一个数字放到最后单独变为一个序列，样例：
5
2 3 12 5 2

code：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
using namespace std;
#define MAXN 120000

int n;
long long  a[MAXN],sum[MAXN];
set<long long>b;
set<long long>eg;

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%I64d",&a[i]);
        sum[i] = sum[i-1]+a[i];
    }
    for(int i=1;i<n;i++)
      if(sum[i] == sum[n]-sum[i])
    {
        printf("YES\n");
        return 0;
    }
    for(int i=1;i<=n;i++)
    {
        b.insert(a[i]);
        if(sum[i] < sum[n]-sum[i]) continue;
        if((2*sum[i]-sum[n]) % 2 != 0) continue;
        long long d = (2*sum[i] - sum[n])/2;
        if(b.count(d) != 0)
        {
            printf("YES\n");
            return 0;
        }
    }
    for(int i=n;i>=1;i--)
    {
        eg.insert(a[i]);
        if(sum[n]-sum[i-1] < sum[i-1]) continue;
        if((sum[n]-2*sum[i-1])%2 != 0) continue;
        long long d = (sum[n]-2*sum[i-1])/2;
        if(eg.count(d) != 0)
        {
            printf("YES\n");
            return 0;
        }
    }
    printf("NO\n");
    return 0;
}