/* -*- coding: utf-8 -*-
 *
 * 1576.cc:  No.1576 織姫と彦星 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000 + 2;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;

/* global variables */

int sts[MAX_N], ds[MAX_N];
vi nbrs[MAX_N];

/* subroutines */

inline int bitcnt(int bits) {
  int cnt = 0;
  for (; bits > 0; bits >>= 1)
    if (bits & 1) cnt++;
  return cnt;
}

/* main */

int main() {
  int n;
  scanf("%d%d%d", &n, sts, sts + 1);

  n += 2;
  for (int i = 2; i < n; i++) scanf("%d", sts + i);

  for (int i = 0; i < n; i++)
    for (int j = i + 1; j < n; j++)
      if (bitcnt(sts[i] ^ sts[j]) == 1) {
	nbrs[i].push_back(j);
	nbrs[j].push_back(i);
      }

  memset(ds, -1, sizeof(ds));
  ds[0] = 0;

  qi q;
  q.push(0);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    if (u == 1) break;

    for (auto v: nbrs[u])
      if (ds[v] < 0) {
	ds[v] = ds[u] + 1;
	q.push(v);
      }
  }

  printf("%d\n", (ds[1] < 0) ? -1 : ds[1] - 1);
  return 0;
}