#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int inf = 0x3f3f3f3f;
const double esp = 1e-6;
const int maxn = 100005;
const int mod = 1e9 + 7;
int dir[4][2] = {0, 1, 1, 0, 0, -1, -1, 0};
int main() {
  int n, map[105], i, j, k;
  while (cin >> n) {
    for (i = 0; i < n; i++) cin >> map[i];
    if (n % 2 == 0) {
      cout << "NO" << endl;
      continue;
    }
    if (n % 2 && map[0] % 2 && map[n - 1] % 2)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
