#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=3e5+5,M=(1<<16)+5,K=(1<<25)+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,A[N],st[N],sh,Mx;
struct node{
	int x,l,r;
	bool operator <(const node &B)const{return x<B.x;}
};
vector<node> Q[N],S[N];
void addl(int x,int id,int l,int r){/*cerr<<"add1 "<<x<<' '<<id<<' '<<l<<' '<<r<<'\n';*/S[x].emplace_back((node){l,id,1});S[x].emplace_back((node){r+1,id,-1});}
void addr(int x,int id,int l,int r){/*cerr<<"add2 "<<x<<' '<<id<<' '<<l<<' '<<r<<'\n';*/Q[x].emplace_back((node){id,l,r});}
namespace BIT{
	int f[N];void add(int x,int y){while(x<=n) f[x]+=y,x+=x&-x;}
	int qry(int x){int ans=0;while(x) ans+=f[x],x-=x&-x;return ans;}
}
void Solve(){
	int i,j;scanf("%d",&n);
	for(i=1;i<=n;i++) scanf("%d",&A[i]),Mx=max(Mx,A[i]);
	for(i=1;i<=n;i++) {
		int x=A[i],LA=i;
		while(x>=A[st[1]]&&sh){
			int l=0,r=sh+1,mid;while(l+1<r) mid=l+r>>1,(A[st[mid]]<=x?l:r)=mid;
			addl(x,i,st[l]+1,LA);LA=st[l];x%=A[LA];
		}
		addl(x,i,1,LA);
		while(sh&&A[st[sh]]>=A[i]) sh--;st[++sh]=i;
	}
	sh=0;for(i=n;i;i--){
		int x=A[i],LA=i;
		while(x>=A[st[1]]&&sh){
			int l=0,r=sh+1,mid;while(l+1<r) mid=l+r>>1,(A[st[mid]]<=x?l:r)=mid;
			addr(x,i,LA,st[l]-1);LA=st[l];x%=A[LA];
		}
		addr(x,i,LA,n);
		while(sh&&A[st[sh]]>=A[i]) sh--;st[++sh]=i;
	}
	ll ans=0;
	for(i=0;i<=Mx;i++){
		sort(Q[i].begin(),Q[i].end());sort(S[i].begin(),S[i].end());
		int R=0;
		for(auto j:Q[i]){
			while(R<S[i].size()&&S[i][R].x<=j.x) BIT::add(S[i][R].l,S[i][R].r),R++;
			ans+=BIT::qry(j.r)-BIT::qry(j.l-1);
		}
		while(R--) BIT::add(S[i][R].l,-S[i][R].r);
	}
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}