Shortest Cycle（容斥原理+floyd求最小环）

http://codeforces.com/contest/1206/problem/D

 

output

standard output

You are given nn integer numbers a1,a2,…,an. Consider graph on nn nodes, in which nodes i, j (i≠j) are connected if and only if, aiAND 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≤10^5) — number of numbers.

The second line contains nn integer numbers a1,a2,…,an (0≤ai≤10^18).

Output

If the graph doesn't have any cycles, output −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).

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

The graph has no cycles in the third example.

 题意：有n个点，当且仅当ai&aj!=0，ai才能与aj相连，问最小的环多大（至少有3个点），如果没有输出-1

思路：根据容斥原理，当非零元素多于128个时，必然存在某一位上的1出现了3次，所以最小的环就是3

          否则非零元素不会超过128个，那就直接floyd求最小环就行了

#include<bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
typedef long long ll;
inline ll min(ll a,ll b){
	return a<b?a:b;
}
const int INF=0x3f3f3f3f;
const int N=150;
ll mp[N][N];
ll dis[N][N];
ll a[N];
int main(){
    int n;
    scanf("%d",&n);
    int cnt=0;
    for(int i=1;i<=n;i++){
    	ll x;
    	scanf("%I64d",&x);
    	if(x!=0){
    		if(cnt<=128)
    		a[++cnt]=x;
		}
	}
    if(cnt>128) printf("3\n");
    else{
    	for(int i=1;i<=cnt;i++){
    		for(int j=1;j<=cnt;j++){
    			if((i!=j)&&(a[i]&a[j])) dis[i][j]=mp[i][j]=1;
    			else dis[i][j]=mp[i][j]=INF;
			}
		}
		int ans=INF;
		for(int k=1;k<=cnt;k++){
			for(int i=1;i<k;i++){
				for(int j=i+1;j<k;j++){
					ans=min(ans,mp[i][k]+mp[k][j]+dis[i][j]);
				}
			}
			for(int i=1;i<=cnt;i++){
				for(int j=1;j<=cnt;j++){
					if(dis[i][k]!=INF&&dis[k][j]!=INF)
					dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
				}
			}
		}
		if(ans>=INF) printf("-1\n");
		else printf("%d\n",ans);
	}
	return 0;
}