//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
template<typename T> 
struct SWAG{
  stack<pair<T,T>>st_front,st_back;
  T func(T x, T y){return gcd(x,y);}
  void push_front(T x){
    if(st_front.empty())st_front.emplace(x,x);
    else st_front.emplace(x,func(x, st_front.top().second));
  }
  void push_back(T x){
    if(st_back.empty())st_back.emplace(x,x);
    else st_back.emplace(x,func(st_back.top().second,x));
  }
  void pop_front(){
    if(st_front.empty()){
      assert(!st_back.empty());
      vector<T>tmp(st_back.size());
      for(ll i=(ll)tmp.size()-1;i>=0;i--){
        tmp[i] = st_back.top().first;
        st_back.pop();
      }
      for(ll i=(((ll)tmp.size()-1)>>1);i>=0;i--)push_front(tmp[i]);
      for(ll i=(((ll)tmp.size()+1)>>1);i<tmp.size();i++)push_back(tmp[i]);
    }
    st_front.pop();
  }
  void pop_back(){
    if(st_back.empty()){
      assert(!st_front.empty());
      vector<T>tmp(st_front.size());
      for(ll i=(ll)tmp.size()-1;i>=0;i--){
        tmp[i] = st_front.top().first;
        st_front.pop();
      }
      for(ll i=(((ll)tmp.size()-1)>>1);i>=0;i--)push_back(tmp[i]);
      for(ll i=(((ll)tmp.size()+1)>>1);i<tmp.size();i++)push_front(tmp[i]);
    }
    st_back.pop();
  }
  T query(){
    //assert(!st_front.empty()||!st_back.empty());
    if(st_front.empty())return st_back.top().second;
    else if(st_back.empty())return st_front.top().second;
    else return func(st_front.top().second, st_back.top().second);
  }
  bool empty(){
    return st_front.empty() && st_back.empty();
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  SWAG<ll>swag;
  ll now=0;
  rep(i,0,n){
    while(now<n&&(swag.empty()||swag.query()!=1)){
      swag.push_back(a[now]);
      now++;
    }
    res+=n-now+(swag.query()==1);
    swag.pop_front();
  }
  cout<<res<<endl;
  return 0;
}