#include<stdio.h>

#define baza 1000000000
typedef int hugenr[1000];

hugenr d[2][1001];

int n,v[501],maxim;
int cmmdc(int a,int b)
{
    int r;
    while(a%b)
    {
        r=a%b;
        a=b;
        b=r;
    }
    return b;
}

void adun(hugenr a, hugenr b)
{
    int i,t=0;
    for(i=1;i<=a[0] || i<=b[0] || t;i++)
    {
        if(i>a[0])
            a[i]=0;
        if(i>b[0])
            b[i]=0;
        a[i]+=b[i]+t;
        t=a[i]/baza;
        a[i]%=baza;
    }
    a[0]=i-1;
}

int main ()
{
    int i,j;
    freopen("indep.in","r",stdin);
    freopen("indep.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        if(v[i]>maxim)
            maxim=v[i];
    }
    d[1][v[1]][0]=d[1][v[1]][1] = 1;
    for(i=1;i<=n-1;i++)
    {
        for (j = 1; j <= maxim; ++j)
            d[(i+1)%2][j][0] = 0;
        d[(i+1)%2][v[i+1]][0] = 1;
        d[(i+1)%2][v[i+1]][1] = 1;
        for(j=1;j<=maxim;j++)
        {
            adun(d[(i+1)%2][cmmdc(j,v[i+1])],d[i%2][j]);
            adun(d[(i+1)%2][j],d[i%2][j]);
        }
    }

    if (d[n%2][1][0] == 0)
    {
        printf("0\n");
        return 0;
    }

    int l = d[n%2][1][0];
    printf("%d", d[n%2][1][l]);
    for(i=l-1;i>=1;i--)
        printf("%09d",d[n%2][1][i]);
    printf("\n");
    return 0;
}