#include <fstream>
#include <vector>

using namespace std;

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

int n, x;
vector<int> dp[505][1005];

void add(vector<int> &a, vector<int> b) {
    if(a.size() < b.size()) {
        swap(a, b);
    }
    int t = 0;
    for(int i = 0; i < a.size() || t != 0; i++) {
        if(i >= a.size()) {
            a.push_back(t % 10);
            t /= 10;
            continue;
        }
        if(i < b.size()) {
            a[i] += b[i];
        }
        a[i] += t;
        t = a[i] / 10;
        a[i] %= 10;
    }
}

int gcd(int a, int b) {
    while(b != 0) {
        int r = a % b;
        a = b;
        b = r;
    }
    return a;
}

int main() {
    fin >> n;
    for(int i = 1; i <= n; i++) {
        fin >> x;
        for(int j = 1; j <= 1000; j++) {
            int cmmdc = gcd(x, j);
            if(dp[i][cmmdc].size() == 0) {
                dp[i][cmmdc] = dp[i - 1][cmmdc];
            }
            add(dp[i][cmmdc], dp[i - 1][j]);
        }
        for(int j = 1; j <= 1000; j++) {
            if(dp[i][j].size() == 0) {
                dp[i][j] = dp[i - 1][j];
            }
        }
        add(dp[i][x], {1});
    }
    for(int i = dp[n][1].size() - 1; i >= 0; i--) {
        fout << dp[n][1][i];
    }
    return 0;
}