Codeforces Round #446 (Div. 1) A. Pride

A. 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

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，否则输出替换次数。思路其实可以分两类，如果这n个数字里面含有m个1，那么交换次数就是n-m，因为只要有1，就可以把另一个任意数字换成1，如果没有1，那我们需要求一个最小的把任意一个书换成1的次数m，然后用n+m-1（用m次交换把数组变成了只有一个1的数组，那么总次数就是m+n-1）。

#include <bits/stdc++.h>

using namespace std;

int n;  
int a[5200];  
  
int gcd(int x,int y)  
{  
    if(x< y)  
        x = x^y,y = x^y,x = x^y;  
    return x%y == 0?y:gcd(y,x%y);  
}  
  
int main()  
{  
    cin>>n;  
    int cnt = 0;  
    for(int i = 1;i<= n;i++)  
    {  
        scanf("%d",&a[i]);  
        if(a[i] == 1)  
            cnt++;  
    }  
    if(cnt)  
    {  
        cout<<n-cnt<<endl;  
        return 0;  
    }  
      
    int mint = 99999999;  
    for(int i = 1;i<= n;i++)  
    {  
        int x = a[i];  
        cnt = 0;  
        for(int j = i+1;j<= n;j++)  
        {  
            cnt++;  
            x = gcd(x,a[j]);  
            if(x == 1)  
                break;  
        }  
        if(x == 1)  
            mint = min(mint,cnt);  
    }  
      
    if(mint == 99999999)  
        cout<<-1<<endl;  
    else  
        cout<<mint+n-1<<endl;  
    return 0;  
}