D - Array Division

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₁, a₂... a_n (1 ≤ a_i ≤ 10⁹) — the elements of the array.

Output

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

Example

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.

这个题想要解决不难，双重循环暴力搜索可以出结果，但是会超时，因此我们需要优化，可以将sum[x]

的搜索化为二分，这样可以减少时间复杂度，因为sum是递增的嘛

#include<iostream>
using namespace std;

typedef long long ll;

const int maxn=100005;

int main()
{
    int n;
    ll a[maxn],sum[maxn];
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
        if(i==0)sum[i]=a[i];
        else sum[i]=sum[i-1]+a[i];
    }
    if(sum[n-1]%2==1)
    {
        cout<<"NO"<<endl;
        return 0;
    }
    ll d=sum[n-1]/2;
    for(int i=0;i<n;i++)
    {
        int l=0,r=n-1,mid;
        while(l<=r)
        {
            mid=(l+r)/2;
            if(sum[mid]-a[i]==d)
            {
                if(mid>i){cout<<"YES"<<endl;return 0;}
                else break;
            }
            if(sum[mid]-a[i]>d)r=mid-1;
            if(sum[mid]-a[i]<d)l=mid+1;

        }

        l=0;r=n-1;
        while(l<=r)
        {
            mid=(l+r)/2;
            if(sum[mid]+a[i]==d)
            {
                if(mid<i){cout<<"YES"<<endl;return 0;}
                else break;
            }
            if(sum[mid]+a[i]>d)r=mid-1;
            if(sum[mid]+a[i]<d)l=mid+1;
        }

    }
    cout<<"NO"<<endl;
    return 0;
}