#include #if __has_include() #include using namespace atcoder; #endif using namespace std; /* #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") */ #define ll long long #define rep(i, n) for (ll i = 0; i < n; ++i) #define rep_up(i, a, n) for (ll i = a; i < n; ++i) #define rep_down(i, a, n) for (ll i = a; i >= n; --i) #define P pair #define pb push_back #define bit_count(x) __builtin_popcountll(x) #define gcd(a,b) __gcd(a,b) #define lcm(a,b) a / gcd(a,b) * b #define endl "\n" #define all(v) v.begin(), v.end() #define fi first #define se second #define vvvvll vector< vector > > > #define vvvll vector< vector< vector > > #define vvll vector< vector > #define vll vector #define pqll priority_queue #define pqllg priority_queue, greater> template inline void vin(vector& v) { rep(i, v.size()) cin >> v.at(i); } template using V = vector; constexpr ll INF = (1ll << 60); //constexpr ll mod = 1000000007; constexpr ll mod = 998244353; constexpr double pi = 3.14159265358979323846; template inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } template void pt(T val) { cout << val << "\n"; } template void pt_vll(vector &v) { ll vs = v.size(); rep(i, vs) { cout << v[i]; if (i == vs - 1) cout << "\n"; else cout << " "; } } ll mypow(ll a, ll n) { ll ret = 1; if (n == 0) return 1; if (a == 0) return 0; rep(i, n) { if (ret > (ll)(9e18 + 10) / a) return -1; ret *= a; } return ret; } long long modpow(long long a, long long n, long long mod) { long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } long long modinv(long long a, long long m) { long long b = m, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= m; if (u < 0) u += m; return u; } //WA or TLE void solve(){ ll n, m, k, cnt = 0, sum = 0, ans = 0; cin>>n; assert(2<=n&&n<=200000); vll a(n); vin(a); rep(i,n){ assert(0<=a[i]&&a[i]<=1000000000); } queue que; rep(i,n-1){ if((a[i]+a[i+1])%2==0&&min(a[i],a[i+1])>0) que.emplace(i); } while(!que.empty()){ ll x=que.front(); que.pop(); k=1; if((a[x]+a[x+1])%2==1) continue; a[x]-=k; a[x+1]-=k; if(x>0&&min(a[x-1],a[x])>0&&(a[x-1]+a[x])%2==0) que.emplace(x-1); if(min(a[x],a[x+1])>0) que.emplace(x); if(x0&&(a[x+1]+a[x+2])%2==0) que.emplace(x+1); //pt(x); } ll flag=0; rep(i,n){ if(a[i]>0) flag=1; } if(flag==0) pt("Yes"); else pt("No"); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); //cout << fixed << setprecision(16); //ll T; //cin>>T; //rep(ca,T) solve(); }