#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
template <typename T>
inline void read(T &x) {
  char c;
  bool nega = 0;
  while ((!isdigit(c = getchar())) && (c != '-'))
    ;
  if (c == '-') {
    nega = 1;
    c = getchar();
  }
  x = c - 48;
  while (isdigit(c = getchar())) x = x * 10 + c - 48;
  if (nega) x = -x;
}
template <typename T>
inline void writep(T x) {
  if (x > 9) writep(x / 10);
  putchar(x % 10 + 48);
}
template <typename T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  writep(x);
}
template <typename T>
inline void writeln(T x) {
  write(x);
  putchar('\n');
}
multiset<ll> Mikoto, Index;
int n;
int a[100001];
int main() {
  read(n);
  for (int i = (1); i <= (n); i++) read(a[i]);
  for (int i = (1); i <= (n); i++) Index.insert(a[i]);
  ll sum = 0;
  for (int i = (1); i <= (n); i++) sum -= a[i];
  for (int i = (0); i <= (n); i++) {
    if (i) {
      sum += a[i] * 2;
      Mikoto.insert(a[i]);
      Index.erase(Index.find(a[i]));
    }
    if (sum % 2) continue;
    if (sum == 0) {
      puts("YES");
      return 0;
    }
    if (sum > 0) {
      if (Mikoto.find(sum / 2) != Mikoto.end()) {
        puts("YES");
        return 0;
      }
    } else {
      if (Index.find(-sum / 2) != Index.end()) {
        puts("YES");
        return 0;
      }
    }
  }
  puts("NO");
}
