#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 1000005;
const double PI = 4 * atan(1);
const long long MAX = 9223372036854775807;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool issquare(long long w) { return trunc(sqrt(w)) * trunc(sqrt(w)) == w; }
bool isprime(long long u) {
  for (long long i = 2; i <= (int)sqrt(u); i++) {
    if (u % i == 0) return 0;
  }
  return 1;
}
long long mod(long long to_mod, long long MOD) {
  to_mod %= MOD;
  while (to_mod < 0) to_mod += MOD;
  return to_mod % MOD;
}
long long moduloMultiplication(long long a, long long b) {
  long long res = 0;
  while (b) {
    if (b & 1) res = (res + a);
    a = (2 * a);
    b >>= 1;
  }
  return res;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long q, y, k, z, w, t, l, r, x, n, m;
long long a[N];
stack<long long> ss;
int main() {
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] = a[i] % 2;
  }
  for (int i = 0; i < n;) {
    if (i == n - 1) {
      if (!ss.empty() && a[i] == ss.top()) {
        ss.pop();
      } else {
        ss.push(a[i]);
      }
      i++;
    } else {
      if (!ss.empty() && a[i] == ss.top()) {
        ss.pop();
        i++;
      } else if (a[i] == a[i + 1]) {
        i += 2;
      } else {
        ss.push(a[i]);
        i++;
      }
    }
  }
  if (ss.size() >= 2)
    cout << "NO";
  else
    cout << "YES";
  return 0;
}
