HDU2509 Be the Winner 博弈

/*和1907几乎完全一样，不解释*/
#include <iostream>  
using namespace std;  
int value[101];  
int main ()  
{  
    int n,sum,temp, i, cnt; 
    while (cin>>n)  
    {
		sum = 0;cnt = 0;
		for(i = 0; i < n; i++)
		{
			cin>>temp;
			sum = sum^temp;
			if(temp > 1)
				cnt = 1;
		}
		if(cnt == 0)
			sum = ( (n-1) % 2 );
        if(sum == 0)
			cout<<"No"<<endl;
		else
			cout<<"Yes"<<endl;
    }  
    return 0;  
}