Not Adding

You have an array a1,a2,…,ana1,a2,…,an consisting of nn distinct integers. You are allowed to perform the following operation on it:

• Choose two elements from the array aiai and ajaj (i≠ji≠j) such that gcd(ai,aj)gcd(ai,aj) is not present in the array, and add gcd(ai,aj)gcd(ai,aj) to the end of the array. Here gcd(x,y)gcd(x,y) denotes greatest common divisor (GCD) of integers xx and yy.

Note that the array changes after each operation, and the subsequent operations are performed on the new array.

What is the maximum number of times you can perform the operation on the array?

Input

The first line consists of a single integer nn (2≤n≤1062≤n≤106).

The second line consists of nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1061≤ai≤106). All aiai are distinct.

Output

Output a single line containing one integer — the maximum number of times the operation can be performed on the given array.

Examples

input

Copy

5
4 20 1 25 30

output

Copy

3

input

Copy

3
6 10 15

output

Copy

4

Note

In the first example, one of the ways to perform maximum number of operations on the array is:

• Pick i=1,j=5i=1,j=5 and add gcd(a1,a5)=gcd(4,30)=2gcd(a1,a5)=gcd(4,30)=2 to the array.
• Pick i=2,j=4i=2,j=4 and add gcd(a2,a4)=gcd(20,25)=5gcd(a2,a4)=gcd(20,25)=5 to the array.
• Pick i=2,j=5i=2,j=5 and add gcd(a2,a5)=gcd(20,30)=10gcd(a2,a5)=gcd(20,30)=10 to the array.

It can be proved that there is no way to perform more than 33 operations on the original array.

In the second example one can add 33, then 11, then 55, and 22.

思路：有无数次更新，在更新中更新，以上一次更新为基础更新这次：可以从1-n范围中选出符合的答案。

gcd：要想算i是不是里面的最大因数，就让i的倍数除以i，看最后gcd是不是1，如果不是1，说明不符合gcd的规则，不是最大的（因数），就不能插入。gcd=1才能插入。只要判断这个数是否存在，便能知道是否要插入这个数。（总结：判断这个数是不是gcd，就看除去这个数后，它的倍数的gcd是不是1（相当于判断它是不是最大的））

gcd模板：

int gcd(int a,int b)
{
    if(!b) return a;
    return gcd(b,a%b);
}

完整代码：

#include <iostream>
#include <algorithm>
#include <cstring>
//#include <cmath>
using namespace std;

const int N=1e6+10;
int a[N];

int main()
{
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        int x;
        cin>>x;
        a[x]=1;
    }
    int ans=0;
    for(int i=1;i<=1000000;i++)
    {
        int g=0;
        for(int j=i;j<=1000000;j+=i)
        {
            if(a[j])
            g=__gcd(g,j/i);
        }
        if(g==1&&!a[i])
        {
            ans++;
        }
    }
    cout<<ans<<endl;
    return 0;
}