#include <iostream>
#include <map>

using namespace std;

typedef long long ll;

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

int main() {
    int n;
    cin >> n;
    ll a[n];
    for(int i=0;i<n;++i){
        cin >> a[i];
    }

    map<ll, ll> mp[n];
    mp[0][a[0]] = 1;
    ll ans = ((a[0] == 1) ? 1 : 0);
    for(int i=1;i<n;++i) {
        ++mp[i][a[i]];
        for(int j=0;j<i;++j) {
            for(auto itr=mp[j].begin();itr!=mp[j].end();++itr) {
                mp[i][gcd(itr->first, a[i])] += itr->second;
            }
        }
        ans += mp[i][1];
    }

    cout << ans << endl;
}