#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------
constexpr int MX = 55;
ll A[MX];

vector<int> divisors(int x) {
    vector<int> ans;
    for(int i=1; i*i<=x; i++) {
        if(x%i!=0) continue;
        ans.emplace_back(i);
        if(i*i!=x) ans.emplace_back(x/i);
    }
    return ans;
}

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

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    int n; cin >>  n;

    FOR(i,0,n-1) cin >> A[i];
    vector<map<ll, ll>> cnt(n);    
    ll ans = 0;
    FOR(i,0,n-1) {
        cnt[i][A[i]]++;
        for(int j=i+1; j<n; j++) {
            for(auto &[k, v]: cnt[i]) {
                cnt[j][GCD(k, A[j])] += v;
            }
        }
        ans += cnt[i][1];
    }
    cout << ans << endl;
    return 0;
}