#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<vector>
#include<map>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second

typedef long long ll;
typedef long double ld;
typedef unsigned long long  ull;
typedef vector<int> vi;

struct pp{ll x,y;};

const int base = 1000*1000*1000;
const int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
const int inf = (int)1e9;
const int mod = 1e9+7;
ll gcd (ll a, ll b) {
        while (b) {
            a %= b;
            swap (a, b);
        }
        return a;
}

/*
void quickSort(int left, int right) {
      int i = left, j = right;
      pp tmp;
      int pivot = a[(left + right) / 2].x;
      while (i <= j) {
            while (a[i].x < pivot)
                  i++;
            while (a[j].x > pivot)
                  j--;
            if (i <= j) {
                 swap(a[i],a[j]);
                  i++,j--;
            }
      };
    if (left < j)
            quickSort(left, j);
      if (i < right)
            quickSort(i, right);
}*/
ll binpow (ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)
			res *= a,res %= mod;
		a *= a,a %= mod;
		n >>= 1;
	}
	return res;
}
ll a[111111];
int main(){
    ll n,x;
    cin>>n;
    ll cnt=0;
    for(ll i=0;i<n;i++){
        cin>>x;
        cnt+=x%2;
    }
    if(cnt%2)cout<<"NO";
    else cout<<"YES";
}
