[codeforces]808D

time limit per test : 2 seconds
memory limit per test : 256 megabytes

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 $a[1], a[2]... a[n] (1 ≤ ai ≤ 10^9)$ — the elements of the array.

Output

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

Examples

Input1

3
1 3 2

Output1

YES

Input2

5
1 2 3 4 5

Output2

NO

Input3

5
2 2 3 4 5

Output3

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.

题意：
一个序列，你可以选择其中一个元素从原来的位置上删除，然后将其插入到序列的任意一个位置。请问是否有可能在做完这个行动之后可以将序列划分成数字和相同的两个部分。

题解:
枚举每个位置的元素，然后二分分割点，假设这个元素移动后处于后半部分，验证，所以需要正着做一遍然后将数组倒转再做一遍。

#include<bits/stdc++.h>
#define LiangJiaJun main
#define ll long long
using namespace std;
int n;
ll a[100004],sum[100004];
bool erfen(int x){
     int l=1,r=n;
     while(l<=r){
        int mid=(l+r)>>1;
        ll L_=sum[mid],R_=sum[n]-sum[mid];
        if(x<=mid)L_-=a[x],R_+=a[x];
        if(L_==R_)return 1;
        if(L_<R_)l=mid+1;
        if(L_>R_)r=mid-1;
     }
     return 0;
}
int LiangJiaJun(){
    scanf("%d",&n);
    sum[0]=0;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        sum[i]=sum[i-1]+a[i];
    }
    if(sum[n]&1)return puts("NO"),0;
    for(int i=1;i<=n;i++){
        if(erfen(i))return puts("YES"),0;
    }
    reverse(a+1,a+n+1);
    sum[0]=0;
    for(int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];
    if(sum[n]&1)return puts("NO"),0;
    for(int i=1;i<=n;i++){
        if(erfen(i))return puts("YES"),0;
    }
    puts("NO");
    return 0;
}