Codeforces Round #580 (Div. 2)-D. Shortest Cycle（思维建图+dfs找最小环）

You are given nn integer numbers a1,a2,…,ana1,a2,…,an. Consider graph on nn nodes, in which nodes ii, jj (i≠ji≠j) are connected if and only if, aiaiAND aj≠0aj≠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)(1≤n≤105) — number of numbers.

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

Output

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

Examples

input

Copy

4
3 6 28 9

output

Copy

4

input

Copy

5
5 12 9 16 48

output

Copy

3

input

Copy

4
1 2 4 8

output

Copy

-1

Note

In the first example, the shortest cycle is (9,3,6,28)(9,3,6,28).

In the second example, the shortest cycle is (5,12,9)(5,12,9).

The graph has no cycles in the third example.

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<vector>
#include<cmath>
#define lson m<<1,l,mid
#define rson m<<1|1,mid+1,r
#define getmid(m) (tree[m].l+tree[m].r)>>1;
const int maxn=1e5+;
typedef long long ll;
using namespace std;
pair<int,int>pp;
vector<int>vec[];
vector<int>G[maxn];
ll a[maxn];
int vis[maxn];
int endd;
int minn=0x3f3f3f3f;
void  dfs(int sta,int dep)
{
    vis[sta]=;
    if(dep>=minn)
    {
          vis[sta]=;
          return;
    }
    for(int t=;t<G[sta].size();t++)
    {
      int u=G[sta][t];
      if(u==endd&&dep>)
      {
          minn=min(minn,dep+);
      }
      if(vis[u]==)
      {
          dfs(u,dep+);
      }
    }
    vis[sta]=;
}
 
int main()
{
    int n;
    cin>>n;
    for(int t=;t<n;t++)
    {
        scanf("%lld",&a[t]);
    }
    for(int t=;t<;t++)
    {
        for(int j=;j<n;j++)
        {
            if(a[j]&((1ll<<t)))
            {
             vec[t].push_back(j);
            }
        }
    }
    for(int t=;t<;t++)
    {
        if(vec[t].size()>=)
        {
            puts("");
            return ;
        }
    }
    for(int t=;t<;t++)
    {
        if(vec[t].size()==)
        {
            int u=vec[t][];
            int v=vec[t][];
            G[u].push_back(v);
            G[v].push_back(u);
        }
    }
    for(int t=;t<n;t++)
    {
        endd=t;
        dfs(t,);
    }
    if(minn==0x3f3f3f3f)
    {
        puts("-1");
    }
    else
    {
    printf("%d\n",minn);
    }
   // system("pause");
    return ;
}