POJ 2234 Matches Game 尼姆博弈

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<stdlib.h>
#include<queue>
#include<math.h>
#include<map>
#define INF 0x3f3f3f3f
#define MAX 1005
#define Temp 1000000000

using namespace std;

int main()
{
    int n,m,ans;
    while(scanf("%d",&n)!=EOF)
    {
        ans=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&m);
            ans^=m;
        }
        if(ans > 0)
            printf("Yes\n");
        else
            printf("No\n");
    }
    return 0;
}