#include #define REP(i,n,N) for(int i=n;i>N; int A[5002]; REP(i,0,N) cin>>A[i]; dp[0]=true; REP(i,0,N) REP(X,0,1<<15) if(dp[X]) dp[X ^ A[i]]=dp[X]; int cnt=count(dp,dp+(1<<15),true); p(cnt); return 0; }