import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] values = new int[n + 2]; List> graph = new ArrayList<>(); for (int i = 0; i < n + 2; i++) { graph.add(new ArrayList<>()); } List> nextTo = new ArrayList<>(); for (int i = 0; i < n + 2; i++) { values[i] = sc.nextInt(); nextTo.add(new HashSet<>()); for (int j = 0; j <= 30; j++) { nextTo.get(i).add(values[i] ^ (1 << j)); } for (int j = 0; j < i; j++) { if (nextTo.get(j).contains(values[i])) { graph.get(i).add(j); graph.get(j).add(i); } } } Deque deq = new ArrayDeque<>(); int[] costs = new int[n + 2]; Arrays.fill(costs, Integer.MAX_VALUE); deq.add(new Path(0, 0)); while (deq.size() > 0) { Path p = deq.poll(); if (costs[p.idx] <= p.value) { continue; } costs[p.idx] = p.value; for (int x : graph.get(p.idx)) { deq.add(new Path(x, p.value + 1)); } } System.out.println(costs[1] == Integer.MAX_VALUE ? -1 : costs[1] - 1); } static class Path { int idx; int value; public Path(int idx, int value) { this.idx = idx; this.value = value; } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }