Codeforces 892C.Pride

C. Pride

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say xand y, and replace one of them with gcd(x, y), where gcd denotes the greatest common divisor.

What is the minimum number of operations you need to make all of the elements equal to 1?

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2000) — the number of elements in the array.

The second line contains n space separated integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the elements of the array.

Output

Print -1, if it is impossible to turn all numbers to 1. Otherwise, print the minimum number of operations needed to make all numbers equal to 1.

Examples

input

5
2 2 3 4 6

output

5

input

4
2 4 6 8

output

-1

input

3
2 6 9

output

4

Note

In the first sample you can turn all numbers to 1 using the following 5 moves:

• [2, 2, 3, 4, 6].
• [2, 1, 3, 4, 6]
• [2, 1, 3, 1, 6]
• [2, 1, 1, 1, 6]
• [1, 1, 1, 1, 6]
• [1, 1, 1, 1, 1]

We can prove that in this case it is not possible to make all numbers one using less than 5 moves.

题目大意：给你n个数，让你进行操作，操作是对两个数取他们的gcd，这个gcd可以将这两个数其中一个替换掉，问将所有的数字变为1最少需要多少次操作

我们应该找能gcd得出1的最小区间，得出他们的距离，这个距离就是将这个小区间变出一个1所需要的步数，只要能得出一个1，再需要n-1步就可以将整个区间变为1了

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=2010;
const int inf=0x3f3f3f3f;
int num[maxn];
int gcd(int a,int b){
	return b==0?a:gcd(b,a%b);
}
int main(){
	int n;
	while(cin>>n){
		int cnt_1=0;
		int ans=inf;
		for(int i=0;i<n;i++){
			cin>>num[i];
			if(num[i]==1) cnt_1++;
		}
		if(cnt_1){
			cout<<n-cnt_1<<endl;
		}
		else{
			for(int i=0;i<n;i++){
				int x=num[i];
				for(int j=i+1;j<n;j++){
					x=gcd(x,num[j]);
					if(x==1){
						ans=min(ans,j-i);
					}
				}
			}
			if(ans==inf) cout<<-1<<endl;
			else cout<<ans+n-1<<endl;
		}
	}
}