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

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
void tostr(ll x,string& res){while(x)res+=('0'+(x%10)),x/=10; reverse(ALL(res)); return;}
template<class T> inline bool chmax(T& a,T b){ if(a<b){a=b;return 1;}return 0; }
template<class T> inline bool chmin(T& a,T b){ if(a>b){a=b;return 1;}return 0; }
//template end

template<class M>struct SWAG{
   using F=function<M(M,M)>; F f; M m0;
   stack<M> fval,bval; vector<M> fsum,bsum;
   SWAG(const F _f,M _m0):f(_f),m0(_m0){}
   M fold(){
      if(fsum.empty()){
         if(bsum.empty())return m0;
         return bsum.back();
      }else{
         if(bsum.empty())return fsum.back();
         else return f(fsum.back(),bsum.back());
      }
   }
   void push(M x){
      bval.push(x);
      if(bsum.empty())bsum.push_back(x);
      else{
         M y=f(bsum.back(),x);
         bsum.push_back(y);
      }
   }
   void pop(){
      if(fval.empty()){
         bsum.clear();
         while(!bval.empty()){
            auto x=bval.top(); bval.pop();
            fval.push(x);
            if(fsum.empty())fsum.push_back(x);
            else{
               M y=f(x,fsum.back());
               fsum.push_back(y);
            }
         }
      }
      fval.pop(); fsum.pop_back();
   }
};

int main(){
   int n; scanf("%d",&n);
   vector<ll> a(n); rep(i,0,n)scanf("%lld",&a[i]);
   SWAG<ll> swag([](ll a,ll b){return __gcd(a,b);},0);
   ll rb=0,res=0;
   rep(i,0,n){
      if(i)swag.pop();
      while(rb<n and swag.fold()!=1){swag.push(a[rb]); rb++;}
      if(swag.fold()==1)res+=n-rb+1;
   } printf("%lld\n",res);
   return 0;
}