#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 998244353;
constexpr ll twoinv = 499122177;
#define fast cin.tie(nullptr); ios_base::sync_with_stdio(false)

int bit_width(ll x) {
return x == 0 ? 0 : static_cast<int>(log2(x)) + 1;
}
int true_solution(int n, ll b, vector<ll> a) {
int d = bit_width(b) - 1;
vector<ll> ltd, eqd;

for (int i = 0; i < n; i++) {
int tmp = bit_width(a[i]) - 1;
if (tmp < d) {
ltd.push_back(a[i]);
}
if (tmp == d) {
eqd.push_back(a[i]);
}
}

bool G[59][59] = {false};
for (int i = 0; i < d; i++) {
G[i][i] = true;
}

for (ll x : ltd) {
b ^= x;
int tmp = bit_width(x) - 1;
for (int j = 0; j < tmp; j++) {
if (~x >> j & 1) {
G[j][tmp] = true;
}
}
}
for (int k = 0; k < d; k++)

for (int i = 0; i < d; i++)
for (int j = 0; j < d; j++)
G[i][j] |= G[i][k] && G[k][j];
for (ll x : eqd) {
if ((b ^ x) == 0) {

return ltd.size() + 1;
}
int s = bit_width(b ^ x) - 1;
for (int j = s; j < d; j++) {
if ((~x >> j & 1) && G[s][j]) {
return ltd.size() + 1;
}
}
}
return ltd.size();
}
int main(){
int n;
cin >> n;
long long b;
cin >> b;
vector<long long> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
cout << true_solution(n,b,a);
}