#line 1 "1990.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "1990.cpp"

bool f(V<ll> B){
	int N = si(B);
	auto B_cp = B;
	V<ll> a(N-1);
	rep(i,N-1){
		a[i] = B[i];
		B[i+1] -= a[i];
	}
	if(B[N-1] != 0) return false;
	rep(i,N-1) if(a[i] < 0) return false;

	B = B_cp;

	V<int> p(N); rep(i,N) p[i] = i%2;
	V<int> q(N); rep(i,N) q[i] = (B[i]+i)%2;
	if(count(all(p),1) != count(all(q),1)) return false;

	int d = 0;
	rep(i,N-1){
		d += p[i] - q[i];
		if(abs(d) > a[i]) return false;
	}
	return true;
}


void TEST(){
	int N,M; cin >> N >> M;
	set<V<ll>> vis;
	queue<V<ll>> q;
	auto push = [&](V<ll> v){
		if(vis.count(v)) return;
		vis.insert(v);
		q.push(v);
	};
	push(V<ll>(N,0));
	while(!q.empty()){
		V<ll> v = q.front(); q.pop();
		rep(i,N-1) if((v[i]+v[i+1])%2 == 0 && v[i] < M && v[i+1] < M){
			v[i]++; v[i+1]++;
			push(v);
			v[i]--; v[i+1]--;
		}
	}

	auto dfs = [&](auto self, V<ll> v, int i){
		if(i == N){
			bool god = vis.count(v);
			bool res = f(v);
			if(god != res){
				show(v); show(god); show(res);
				exit(0);
			}
			return;
		}
		rep(j,M+1){
			v[i] = j;
			self(self,v,i+1);
		}
	};
	dfs(dfs,V<ll>(N,0),0);
	cerr << "OK" << endl;
	exit(0);
}


bool solve(){
	int N; cin >> N; V<ll> B(N); rep(i,N) cin >> B[i];
	return f(B);
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	// TEST();

	cout << (solve() ? "Yes" : "No") << endl;
}