daily 1

CF 1833C

solve()
{
    cin>>n;
    for(int i=1;i<=n;i++) cin>>w[i];
    sort(w+1,w+n+1);
    if(w[1]%2) cout<<"YES"<<endl;
    else{
        for(int i=1;i<=n;i++)
            if(w[i]%2){
                cout<<"NO"<<endl;
                return ;
            }
        cout<<"YES"<<endl;
    }
}