#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}




void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<ll> B(N),C(N+1);
	rep(i,N) cin>>B[i];
	rep(i,N) C[i+1]=B[i]-C[i];
	if(C[N]!=0){
		yneos(0);
		return ;
	}
	//vec_out(C);
	rep(i,N){
		if(C[i]<0){
			yneos(0);
			return ;
		}
	}
	//int J=1;
	//int L=1;
	auto f=[&](int l,int r)->bool{
		if(r==l) return true;
		int X=r-l;
		vector<int> p(X+2);
		rep(i,X) p[i+1]=C[l+i];
		vector<int> q(2);
		rep(i,X+1){
			if((p[i]+p[i+1])%2==1){
				q[i%2]++;
			}
			if(abs(q[0]-q[1])>C[i+1]) return false;
		}
		return true;
	};
	yneos(f(1,N));
}