#include <fstream>
#include <algorithm>
#include <cstring>
using namespace std;
ifstream fin("indep.in");
ofstream fout("indep.out");

const int nmax = 500;



int n;

struct huge{
int val[1000];

huge()
{
    memset(val,0,sizeof(val));
    val[0]=1;
    val[1]=0;
}
huge(int x)
{
    memset(val,0,sizeof(val));
    val[0]=1;
    val[1]=x;
}
void operator +=(const huge& b)
{
    val[0]=max(val[0],b.val[0]);
    int t=0;
    for(int i = 1;i<=val[0];i++)
    {
        val[i]+=b.val[i]+t;
        t=val[i]/10;
        val[i]%=10;
    }
    while(t)
        val[++val[0]]=t%10,t/=10;
}
void afis(){
    for(int i = val[0];i>0;i--)
        fout<<val[i];
}



}d[1005];


int main()
{
    huge one(1);
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        int x;
        fin>>x;
        for(int j = 1; j<=1000;j++)
            if(d[j].val[0] != 1 || d[j].val[1]!=0)
                d[__gcd(j,x)] += d[j];
        d[x]+=one;
    }
    d[1].afis();
}