#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<algorithm>

 #include<cmath>

 #include<set>

 #include<map>

 #include<utility>

 using namespace std;

 typedef long long ll;

 const int maxn=1e5+;

 ll a[maxn];

 ll sum[maxn];

 multimap<ll,int> m;

 multimap<ll,int> ::iterator it;

 pair<multimap<ll,int>::iterator,multimap<ll,int>::iterator> pos;

 int main()

 {

     int n;

     scanf("%d",&n);

     memset(sum,,sizeof(sum));

     for(int i=;i<=n;i++)

     {

         scanf("%lld",&a[i]);

         m.insert(make_pair(a[i],i));

         sum[i]=sum[i-]+a[i];

     }

     if(sum[n]%==)

     {

         printf("NO\n");

         return ;

     }

     ll half=sum[n]/;

     for(int i=;i<=n;i++)

     {

         ll s=sum[i]-half;

         if(s==)

         {

             printf("YES\n");

             return ;

         }

         else if(s>)

         {

             pos=m.equal_range(s);

             while(pos.first!=pos.second)

             {

                 if(pos.first->second<=i)

                 {

                     printf("YES\n");

                     return ;

                 }

                 pos.first++;

             }

         }

         else

         {

             s=-s;

             pos=m.equal_range(s);

             while(pos.first!=pos.second)

             {

                 if(pos.first->second>i)

                 {

                     printf("YES\n");

                     return ;

                 }

                 pos.first++;

             }

         }

     }

     printf("NO\n");

     return ;

 }