#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
const int MOD = 1e9 + 7;
const double PI = 3.141592653589793238460;
long long power(long long a, long long b) {
  long long res = 1;
  if (a == 0) return 0;
  if (a == 1) return 1;
  for (; b > 0; b >>= 1) {
    if (b & 1) res = (res * a);
    if (res > MOD) res %= MOD;
    a = (a * a);
    if (a > MOD) a = a % MOD;
  }
  return res;
}
bool isPrime[1000000 + 1];
vector<long long> prime;
void seive(int limit) {
  isPrime[0] = isPrime[1] = 1;
  for (int i = 2; i * i <= limit; i++) {
    if (!isPrime[i])
      for (int j = i * i; j <= limit; j += i) {
        isPrime[j] = 1;
      }
  }
  for (int i = 2; i <= limit; i++)
    if (!isPrime[i]) prime.push_back(i);
}
map<int, int> m;
int getMex(int arr[], int n) {
  for (int i = 0; i <= n; i++) {
    if (m[i] > 0)
      continue;
    else
      return i;
  }
}
bool asc(int arr[], int n) {
  for (int i = 1; i < n; i++)
    if (arr[i] < arr[i - 1]) return 0;
  return 1;
}
int main() {
  int tt;
  tt = 1;
  while (tt--) {
    int n;
    cin >> n;
    long long arr[n];
    for (int i = 0; i < n; i++) cin >> arr[i];
    for (int i = 1; i < n; i++) arr[i] += arr[i - 1];
    long long ps = 0, ss = 0;
    set<long long> s;
    for (int i = 0; i < n; i++) {
      if (i == 0)
        s.insert(arr[i]);
      else
        s.insert(arr[i] - arr[i - 1]);
      ps = arr[i];
      ss = arr[n - 1] - arr[i];
      long long ele = (ps - ss) / 2;
      if (ps == ss) return cout << "YES", 0;
      if ((ps - ss) % 2 == 0 and s.count(ele)) return cout << "YES", 0;
    }
    s.clear();
    for (int i = n - 2; i >= 0; i--) arr[i + 1] -= arr[i];
    reverse(arr, arr + n);
    for (int i = 1; i < n; i++) arr[i] += arr[i - 1];
    for (int i = 0; i < n; i++) {
      if (i == 0)
        s.insert(arr[i]);
      else
        s.insert(arr[i] - arr[i - 1]);
      ps = arr[i];
      ss = arr[n - 1] - arr[i];
      long long ele = (ps - ss) / 2;
      if (ps == ss) return cout << "YES", 0;
      if ((ps - ss) % 2 == 0 and s.count(ele)) return cout << "YES", 0;
    }
    cout << "NO"
         << "\n";
  }
}
