#include<iostream> using namespace std; long long n,k,a[500010],q[500010],l,sum; int main(){ //freopen("xor.in","r",stdin); //freopen("xor.out","w",stdout); cin>>n>>k; for(int i=1;i<=n;i++){ cin>>a[i]; q[i]=q[i-1]^a[i]; } for(int i=1;i<=n;i++){ for(int j=l;j<i;j++){ if((q[i]^q[j])==k){ sum++; l=i; break; } } } cout<<sum; return 0; }