Submission #3622257

---

Source Code Expand

// In the name of God

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int maxn=1e5+10,mod=1e9+7;
const ll inf=1e18;

int main(){
    int n;cin>>n;
    bool yes=1;
    for(int i=1;i<=n;i++){
	int x;cin>>x;
	if((x&1) != (i&1))
	    yes=0;
    }
    if(yes)
	cout<<"Yes\n";
    else
	cout<<"No\n";
    return 0;
}

Submission Info

Judge Result