#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
const long long maxn = 200005;
const long long mod = 1000000007;
const long double eps = 1e-9;
const long long inf = ((1ll << 31ll) - 1ll);
const long long INF = 2000000000000000000ll;
const long double pi = acos(-1);
long long qpow(long long b, long long e) {
  if (!e) return 1;
  if (e & 1) return qpow(b, e - 1) * b % mod;
  long long pwur = qpow(b, e >> 1);
  return (pwur * pwur) % mod;
}
long long modinv(long long x) { return qpow(x, mod - 2); }
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.setf(ios::fixed);
  cout.precision(0);
  srand(time(NULL));
  long long n;
  cin >> n;
  vector<long long> v(n);
  long long odd = 0, even = 0;
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    if (v[i] % 2 == 0)
      even++;
    else
      odd++;
  }
  cout << (abs(odd - even) <= 1 ? "Yes" : "No");
  return 0;
}
