#include <bits/stdc++.h>
using namespace std;
using namespace std;
long long powm(long long base, long long exp, long long mod = 1000000007) {
  long long ans = 1;
  while (exp) {
    if (exp & 1) ans = (ans * base) % mod;
    exp >>= 1, base = (base * base) % mod;
  }
  return ans;
}
long long a[100005];
int main() {
  long long n;
  cin >> n;
  for (long long i = 1; i < n + 1; i++) cin >> a[i];
  if (n % 2 == 0) return 0 * printf("NO\n");
  if (a[1] % 2 == 0) return 0 * printf("NO\n");
  if (a[n] % 2 == 0) return 0 * printf("NO\n");
  return 0 * printf("YES\n");
}
