#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> b(n); REP(i, n) cin >> b[i];
  vector<int> op(n - 1, 0);
  op.front() = b.front();
  FOR(i, 1, n - 1) {
    op[i] = b[i] - op[i - 1];
    if (op[i] < 0) {
      cout << "No\n";
      return 0;
    }
  }
  if (op[n - 2] != b[n - 1]) {
    cout << "No\n";
    return 0;
  }
  vector<int> imos(n, 0);
  int index = 1;
  REP(i, n) {
    if ((b[i] + i) % 2 == 1) {
      if (index >= n) {
        cout << "No\n";
        return 0;
      }
      if (index < i) {
        ++imos[index];
        --imos[i];
      } else {
        ++imos[i];
        --imos[index];
      }
      index += 2;
    }
  }
  if (index < n) {
    cout << "No\n";
    return 0;
  }
  FOR(i, 1, n) imos[i] += imos[i - 1];
  REP(i, n - 1) {
    if (imos[i] > op[i]) {
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}