#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int nmax=500,vmax=1000,lmax=1000000;
int n,in[nmax+5],npr,pr[nmax+5];
bool ci[nmax+5];
struct sp
{
    char ch[nmax+5];
    int len;
    sp operator + (const sp & other)
    {
        int i,l2=max(len,other.len);
        sp ans;
        for(i=1;i<=l2;i++)
        {
        ans.ch[i]+=ch[i]+other.ch[i];
        if(ans.ch[i]>9)
        {
        ans.ch[i+1]++;
        ans.ch[i]-=10;
        }
        }
        if(ans.ch[i+1]>0)
        l2++;
        ans.len=l2;
        return ans;
    }
};
sp di[nmax+5][nmax+5];
long long pre[nmax+5][nmax+5];
void ciur()
{
  npr++;
    pr[npr]=2;
    for(int i=3;i<=n;i=i+2)
    if(ci[i]==0)
    {
        npr++;
        pr[npr]=i;
        for(int j=i*i;j<=n;j=j+2*i)
        ci[j]=1;
    }
}
int cmmdc(int a,int b)
{
    if(a>b)
    swap(a,b);
    if(a==0)
    return b;
    return cmmdc(b%a,a);
}
int main()
{
    freopen("indep.in","r",stdin);
    freopen("indep.out","w",stdout);
    int m,i,j;
    long long ans=0;
    sp unu;
    unu.ch[1]=1;
    unu.len=1;
    cin>>n;
    for(i=1;i<=n;i++)
    cin>>in[i];
    ciur();
    for(i=0;i<=nmax;i++)
    for(j=0;j<=nmax;j++)
    pre[i][j]=cmmdc(i,j);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=nmax;j++)
        di[i][j]=di[i-1][j];
            di[i][in[i]]=di[i][in[i]]+unu;
    for(j=1;j<=nmax;j++)
    di[i][pre[in[i]][j]]=di[i][pre[in[i]][j]]+di[i-1][j];
    }
    for(i=di[n][1].len;i>=1;i--)
    printf("%d",di[n][1].ch[i]);
    printf("\n");
    return 0;
}