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=105;
int num[Nmax];
int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&num[i]);
            sum^=num[i];
        }
        if(sum==0)
            printf("0
");
        else
        {
            int ans=0;
            for(int i=1;i<=n;i++)
            {
                int a=sum^num[i];
                if(a<=num[i])
                    ans++;
            }
            printf("%d
",ans);
        }
    }
    return 0;
}