#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int gcd(int a,int b)
{
    if (a%b==0) return(b);
    else return(gcd(b,a%b));
}
signed main(void){
    itn n; cin>>n;
    int ans = 0;
    vector <int> a(n);  
    rep(i,n) cin>>a[i];
    vector <map<int,int>> dp(n); //i番目が最後,gcdがjになるそれが k個 
    for(int i=0;i<n;i++){ //i<j
        dp[i][a[i]] += 1;
        for(int j=i+1;j<n;j++){
            for(auto e: dp[i]){
                
                dp[j][gcd(e.first, a[j])] += e.second;
            }
        }
        ans += dp[i][1];
    }
    cout<<ans<<endl;
}