#include<bits/stdc++.h>
using namespace std;
const int N = 10;
int f[N];
int n,x;
//int dp[N][N];
void solve(){
    cin>>n;
    while(n--){
        cin>>x;
        f[x%2]++;
    }
    if(f[0]>f[1])cout<<"NO";
    else cout<<"YES";
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);  
    solve();
    return 0;
}