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

const int LMAX = 505;

int dp[LMAX][2*LMAX][170];
void sum(int b[], int c[]) {
    //b = b + c
    b[0] = max(b[0], c[0]);
    int r = 0;
    for (int i = 1; i <= b[0]; i++) {
        b[i] = (b[i] + c[i] + r)%10;
        r = (b[i] + c[i] + r)/10;
    }
    if (r) {
        b[0]++;
        b[b[0]] = 1;
    }
}
void afis(int b[]) {
    for (int i = 1; i <= b[0]; i++) {
        fout<<b[i];
    }
}
int a[LMAX];
//dp[i][j] nr de subsecvente cu primele i elemenete care au cmmdc j
int cmmdc(int a, int b) {
    int r;
    while (b) {
        r = a%b;
        a = b;
        b = r;
    }
    return a;
}

int main() {
    int n, i, j;
    fin>>n;
    for (i = 1; i <= n; i++) {
        fin>>a[i];
        for (j = 1; j <= 1000; j++) {
            ///nu adaugam al i ulea element
            sum(dp[i][j],dp[i-1][j]);
            ///adaugam al i ulea element
            sum(dp[i][cmmdc(a[i], j)],dp[i-1][j]); ///pt ca la fiecare subsecv de cmmdc j fac cmmdc cu a[i]
        }
        ///fac o noua secv cu a[i]
        int aux[] = {1, 1};
        sum(dp[i][a[i]],aux);
    }
    afis(dp[n][1]);

    fin.close();
    fout.close();
    return 0;
}