#include <bits/stdc++.h>

using namespace std;

const int BASE = (int)1e9;
const int VSIZE = 1000 + 10;
const int NSIZE = 500 + 10;

vector < int > d[2][VSIZE];
int N , i , j , lim , l;
vector < int > UNU;
int x[NSIZE];

int gcd(int x , int y)
{
    int r;
    while (y)
    {
        r = x % y;
        x = y;
        y = r;
    }
    return x;
}

void add(vector < int > &a , vector < int > b)
{
    int t = 0;

    for (int i = a.size() ; i < b.size() ; ++i)
    a.push_back(0);

    for (int i = 0 ; i < a.size() || i < b.size() ; ++i)
    {
        if (i < b.size()) a[i] += b[i];

        a[i] += t;
        t = a[i] / BASE;
        a[i] %= BASE;
    }

    if (t) a.push_back(t);
}

int main()
{

freopen("indep.in" , "r" , stdin);
freopen("indep.out" , "w" , stdout);

scanf("%d" , &N);
UNU.push_back(1);

for (i = 1 ; i <= N ; ++i)
{
    scanf("%d" , &x[i]);
    lim = max(lim , x[i]);
}

for (i = 1 ; i <= N ; ++i)
{
    l = i % 2;
    for (j = 1 ; j <= lim ; ++j)
    d[l][j].clear();

    for (j = 1 ; j <= lim ; ++j)
    {
        add(d[l][gcd(j , x[i])] , d[1 - l][j]);
        add(d[l][j] , d[1 - l][j]);
    }

    add(d[l][x[i]] , UNU);
}

printf("%d", d[l][1].back());

for (i = d[l][1].size() - 2 ; i >= 0; --i)
printf("%.9d", d[l][1][i]);

return 0;
}