#include <fstream>
#include <vector>
#include <cstring>
using namespace std;

const int MAX_N = 502;
const int MAX_VAL = 1001;
const int MAX_DIG = 350;

typedef int Huge[MAX_DIG];

int N;
int v[MAX_N];
Huge dp[2][MAX_VAL];

void read() {
    ifstream f("indep.in");

    f >> N;
    for(int i = 1; i <= N; ++i)
        f >> v[i];

    f.close();
}

inline int gcd(int a, int b) {
    int r;

    while(b) {
        r = a % b;
        a = b;
        b = r;
    }

    return a;
}

void add(Huge a, Huge b) {
    int t = 0;

    if(a[0] > b[0])
        for(int i = b[0] + 1; i <= a[0]; ++i)
            b[i] = 0;
    if(b[0] > a[0]) {
        for(int i = a[0] + 1; i <= b[0]; ++i)
            a[i] = 0;
        a[0] = b[0];
    }
    for(int i = 1; i <= a[0]; ++i) {
        a[i] += b[i] + t;
        t = a[i] / 10;
        a[i] %= 10;
    }
    while(t)
        a[++a[0]] = t % 10, t /= 10;
}

void solve() {
    Huge one;
    for(int i = 0; i < MAX_DIG; ++i)
        one[i] = 0;
    one[0] = one[1] = 1;

    add(dp[1][v[1]], one);
    for(int i = 2; i <= N; ++i) {
        int r = i % 2;
        for(int j = 1; j < MAX_VAL; ++j)
            dp[r][j][0] = 0;
        for(int j = 1; j < MAX_VAL; ++j) {
                int c = gcd(j, v[i]);
                add(dp[r][c], dp[r ^ 1][j]);
            }
        for(int j = 1; j < MAX_VAL; ++j)
            add(dp[r][j], dp[r ^ 1][j]);
        add(dp[r][v[i]], one);
    }
}

void write() {
    ofstream g("indep.out");

    for(int i = dp[N % 2][1][0]; i >= 1; --i)
        g << dp[N % 2][1][i];
    if(dp[N % 2][1][0] == 0)
        g << 0;
    g << "\n";

    g.close();
}

int main() {
    read();
    solve();
    write();

    return 0;
}