// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;

ll dp[51][51 * 10010];

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a%b);
}

int main() {
    int N; cin >> N;
    vector<int> A(N), divs;
    for(int i=0; i<N; i++) {
        cin >> A[i];
        for(int d=1; d*d<=A[i]; d++) {
            if(A[i] % d == 0) {
                divs.emplace_back(d);
                if(A[i] / d != d) divs.emplace_back(A[i] / d);
            }
        }
    }

    divs.emplace_back(0);
    sort(divs.begin(), divs.end());
    divs.erase(unique(divs.begin(), divs.end()), divs.end());

    dp[0][0] = 1;
    for(int i=0; i<N; i++) {
        for(int j=0; j<divs.size(); j++) {
            if(dp[i][j] == 0) continue;
            // 使わない
            dp[i+1][j] += dp[i][j];

            // 使う
            int g = gcd(divs[j], A[i]);
            int k = lower_bound(divs.begin(), divs.end(), g) - divs.begin();
            dp[i+1][k] += dp[i][j];
        }
    }
    cout << dp[N][1] << endl;
    return 0;
}