#include #include int dp[2][1<<15]; using namespace std; int main() { int n; while (cin>>n) { memset(dp, 0, sizeof(dp)); int k=0; dp[0][0]=1; while (n--) { int a; cin>>a; for(int i=0;i<(1<<15);++i) if (dp[k][i]) dp[1^k][i]=dp[1^k][i^a]=1; k=1^k; } int res=0; for(int i=0;i<(1<<15);++i) res+=dp[k][i]; cout<