最小环 floyd java_干货｜Floyd求最小环(CF Shortest Cycle)

作者：Water_Fox

来源：牛客网

You are given nn integer numbers a1,a2,…,ana1,a2,…,an. Consider graph on nn nodes, in which nodes i, j (i≠j) are connected if and only if, aiai AND aj≠0, where AND denotes the bitwise AND operation.

Find the length of the shortest cycle in this graph or determine that it doesn't have cycles at all.

Input

The first line contains one integer nn (1≤n≤105) — number of numbers.

The second line contains nn integer numbers a1,a2,…,ana1,a2,…,an (0≤ai≤1018).

Output

If the graph doesn't have any cycles, output −1. Else output the length of the shortest cycle.

Examples

input

4

3 6 28 9

output

4

input

5

5 12 9 16 48

output

3

input

4

1 2 4 8

output

-1

Note

In the first example, the shortest cy