CF892C (gcd++）

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

Copy

5
2 2 3 4 6

output

Copy

5

input

Copy

4
2 4 6 8

output

Copy

-1

input

Copy

3
2 6 9

output

Copy

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.

题意：大体的意思就是给你一串数，可以进行的操作是把两个相邻数的任意一个替换成他们的最大公约数，问你最少需要多少次操作才能把这一串数都变成1

思路：其实想想不难，如果这一串数中有一个1，那么用这个1去和他相邻的数做gcd，总共需要做n-1次就可以完成。

以此类推，如果有m个1，就需要n-m次操作。

那如果原来的序列中没有1呢？

那就只能用到枚举，枚举所有可能出现的情况来寻找把其中一个数变为1的最少的操作次数，剩下的就用上边的结论就可以了。

AC代码;

#include<iostream>
#include<cstdio>
#define inf 0x3f3f3f
using namespace std;
int a[2005];
int gcd(int a,int b)
{
	return b?gcd(b,a%b):a;
}
int main()
{
	int n,i,j;
	int cnt=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		if(a[i]==1)  cnt++;
	 } 
	 if(cnt)
	 {
	 	cout<<n-cnt<<endl;
	 	return 0;
	 }
	 int index=0;
	 int flag=0;
	 int minn=inf;
	 for(i=1;i<=n;i++)
	 {
	 	int x=a[i];
	 	for(j=i+1;j<=n;j++)
	 	{
	 		x=gcd(x,a[j]);
	 		if(x==1)
	 		{
	 		    index=j-i;
	 			minn=min(minn,index);
	 			flag=1;
	 			break;
			 }
		 }
	 }
	 if(flag)
	 cout<<n-1+minn<<endl;
	 else cout<<"-1"<<endl;
	return 0;
 }