Codeforces Round #579 (Div. 3)——C. Common Divisors

C. Common Divisors

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array aa consisting of nn integers.

Your task is to say the number of such positive integers xx such that xx divides each number from the array. In other words, you have to find the number of common divisors of all elements in the array.

For example, if the array aa will be [2,4,6,2,10][2,4,6,2,10], then 11 and 22 divide each number from the array (so the answer for this test is 22).

Input

The first line of the input contains one integer nn (1≤n≤4⋅1051≤n≤4⋅105) — the number of elements in aa.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤10121≤ai≤1012), where aiai is the ii-th element of aa.

Output

Print one integer — the number of such positive integers xx such that xx divides each number from the given array (in other words, the answer is the number of common divisors of all elements in the array).

Examples

input

Copy

5
1 2 3 4 5

output

Copy

1

input

Copy

6
6 90 12 18 30 18

output

Copy

4

最大公约数+算术基本定理

算术基本定理：

 

#include<bits/stdc++.h>
using namespace std;
long long A[400010],prime[1000000];
bool b[1000010];
long long solve(long long x)
{
    long long r=0;
    for(long long i=2; i<=1000000; i++)
    {
        if(b[i]==0)
        {
            for(long long j=i*2; j<=1000000; j+=i)
            {
                b[j]=1;
            }
            prime[++r]=i;
        }
    }
    printf("%I64d\n",prime[r]);
    long long ans=1;
    for(long long i=1;i<=r&&x!=1;i++)
    {
        long long judge=0;
        while(x%prime[i]==0)
        {
            x/=prime[i];
            judge++;
        }
        ans*=(judge+1);
    }
    if(x!=1) ans*=2;
    return ans;
}
int main()
{
    long long n;
    scanf("%I64d",&n);
    for(long long i=1; i<=n; i++)
        scanf("%I64d",&A[i]);
    long long ans=A[1];
    for(long long i=1; i<=n; i++)
        ans=__gcd(ans,A[i]);
    printf("%I64d\n",solve(ans));
}