#include <bits/stdc++.h>
#include <atcoder/all>
// https://qandori.github.io/cp-library/
using namespace std;
using namespace atcoder;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
// g++ a.cpp -std=c++23 -I.
// g++ -std=c++23 -I. a.cpp -o main
// g++ -std=c++23 -I. anaive.cpp -o naive
// g++ -std=c++23 -I. agene.cpp -o gene

using mint = modint998244353;


int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n;
    cin>>n;
    vl z(n);
    rep(i,0,n)cin>>z[i];
    vl e(n-1);
    ll now=z[0];
    rep(i,0,n-1){
        e[i]=now;
        if(now<0){
            cout<<"No"<<endl;
            return 0;
        }
        now=z[i+1]-now;
    }
    if(now!=0){
        cout<<"No"<<endl;
        return 0;
    }
    vl r(n);
    vl rr(n);
    rep(i,0,n){
        if(i%2==1)r[i]=1;
        if((i+z[i])%2==1)rr[i]=1;
    }
    
    ll ss=0;
    ll tt=0;
    rep(i,0,n){
        ss+=r[i];
        tt+=rr[i];
        if(i==n-1)break;
        if(e[i]<abs(ss-tt)){
            cout<<"No"<<endl;
            return 0;
        }
    }
    
    if(ss!=tt){
        cout<<"No"<<endl;
        return 0;
    }
    cout<<"Yes"<<endl;
}