#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, a[maxn], flag;
long long s1[maxn], sum;
void Search1(int l, int r, long long x) {
  int m = (l + r) / 2;
  if (l > r) return;
  if (s1[m] == x) {
    flag = 1;
    return;
  } else if (s1[m] > x)
    Search1(l, m - 1, x);
  else
    Search1(m + 1, r, x);
}
int main() {
  while (scanf("%d", &n) != EOF) {
    flag = 0, a[0] = 0, s1[0] = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      s1[i] = s1[i - 1] + a[i];
    }
    if (s1[n] % 2 == 1)
      printf("NO\n");
    else {
      sum = s1[n] / 2;
      for (int i = 0; i <= n; i++) {
        Search1(1, i - 1, sum - a[i]);
        Search1(i, n, sum + a[i]);
        if (flag == 1) break;
      }
      if (flag)
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
}
