HDU1850 Being a Good Boy in Spring Festival

 /*
  HDU1850 Being a Good Boy in Spring Festival
  http://acm.hdu.edu.cn/showproblem.php?pid=1850
  博弈论 尼姆博弈

  尼姆博弈：异或和为0则先手必败，否则先手必胜
  *
  *
  */
 #include <cstdio>
 #include <cmath>
 using namespace std;
 const int Nmax=;
 int num[Nmax];
 int main()
 {
     int n;
     while(scanf("%d",&n)&&n)
     {
         int sum=;
         for(int i=;i<=n;i++)
         {
             scanf("%d",&num[i]);
             sum^=num[i];
         }
         if(sum==)
             printf("0\n");
         else
         {
             int ans=;
             for(int i=;i<=n;i++)
             {
                 int a=sum^num[i];
                 if(a<=num[i])
                     ans++;
             }
             printf("%d\n",ans);
         }
     }
     return ;
 }