#include <bits/stdc++.h>

using namespace std;

ifstream fin  ("indep.in");
ofstream fout ("indep.out");

int n, i, j, gcd;
int v[505], d[505][1005];

//d[i][j] = nr de subsiruri din primele i elemente divizibile cu j

int main(){
    fin >> n;
    for (i=1; i<=n; i++){
        fin >> v[i];
    }
    d[1][v[1]] = 1;
    for (i=2; i<=n; i++){
        for (j=1; j<=1000; j++){
            gcd = __gcd (j, v[i]);
            d[i][gcd] += d[i-1][j];
            d[i][j] += d[i-1][j];
        }
        d[i][v[i]]++;
    }
    fout << d[n][1];
    return 0;
}