#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>


using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)


const i64 INF = 1001001001001001001;
using modint = atcoder::static_modint<998244353>;




int main(){
    int N; cin >> N;
    vector<i64> B(N+2, 0); rep(i,N) cin >> B[i+1];
    vector<int> A(N+2, 0);
    rep(i,N+1){
        if(B[i] % 2 == B[i+1] % 2) continue;
        bool match = (i%2) == (B[i]%2);
        A[i+1] = (match ? 1 : -1);
    }
    rep(i,N+1) A[i+1] += A[i];
    bool ans = true;
    rep(i,N+2) if(abs(A[i]) > B[i]) ans = false;
    rep(i,N+2) B[i] -= abs(A[i]);
    i64 t = 0;
    rep(i,N+2) t += B[i] * ((i%2==0) ? 1 : -1);
    if(t != 0) ans = false;
    rep(i,N+1){
        if(B[i] < 0) ans = false;
        B[i+1] -= B[i];
        B[i] = 0;
    }
    cout << (ans ? "Yes" : "No") << '\n';
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;