/*int le(int x){return x<<1;}
int re(int x){return (x<<1)+1;}

struct nd{
	int l,r;
	int ls,rs;
	int mx;
	int mn;
}a[1000005];

void update(int x){
	a[x].mx = max(a[le].mx,a[re].mx);
	a[x].mn = min(a[le].mn,a[re].mn);
}

void build(int x,int l,int r){
	a[x].l = l;
	a[x].r = r;
	a[x].mx = -0x3f3f3f3f;
	a[x].mn = 0x3f3f3f3f;
	if(l == r){
		a[x].val = a[l];
		return;
	}
	int mid = (l+r)>>1;
	build(le(x),l,mid);
	build(re(x),mid+1,r);
	a[x].ls = le(x);
	a[x].rs = re(x);
	update(x);
}*/
#include<bits/stdc++.h>

#define st s[t]
#define s1 s[1]
#define s2 s[2]
#define s3 s[3]
#define s4 s[4]
#define ft f[t]
#define f1 f[1]
#define f2 f[2]
#define f3 f[3]
#define f4 f[4]
#define tpt tp[t]
#define tp1 tp[1]
#define tp2 tp[2]
#define tp3 tp[3]
#define tp4 tp[4]
#define int long long

using namespace std;

int n,ans;
int a[1000005];
int mp[1000005];

int s[5][1000005];
int f[5][1000005];
int tp[5];

int read(){
    int x = 0,y = 1;
    char ch = getchar();
    while(ch > '9'||ch < '0'){
        if(ch == '-') y = -1;
        ch = getchar();
    }
    while(ch <= '9'&&ch >= '0'){
        x = x*10+ch-'0';
        ch = getchar();
    }
    return x*y;
}

void pu1(int t,int x){
	while(tpt > 0&&a[st[tpt]] < a[x]){
		ft[st[tpt]] = x;
		tpt--;
	}
	st[++tpt] = x;
}

void pu2(int t,int x){
	while(tpt > 0&&a[st[tpt]] < a[x]){
		ft[st[tpt]] = x;
		tpt--;
	}
	st[++tpt] = x;
}

void pu3(int t,int x){
	while(tpt > 0&&a[st[tpt]] > a[x]){
		ft[st[tpt]] = x;
		tpt--;
	}
	st[++tpt] = x;
}

void pu4(int t,int x){
	while(tpt > 0&&a[st[tpt]] > a[x]){
		ft[st[tpt]] = x;
		tpt--;
	}
	st[++tpt] = x;
}

signed main(){
	
	n = read();
	for(int i = 1;i <= n;++ i)
		a[i] = read(),mp[a[i]] = i; 
	
	for(int i = 1;i <= n;++ i)
		pu2(2,i),pu4(4,i);
	for(int i = n;i >= 1;-- i)
		pu1(1,i),pu3(3,i);
	
	for(int i = 1;i <= n;++ i){
		for(int j = i;j <= n;j += i){
			if(mp[i] <= mp[j]){
				int xz = f3[mp[i]];
				int xy = f4[mp[i]];
				int dz = f1[mp[j]];
				int dy = f2[mp[j]];
				if(!xy) xy = n+1;
				if(!dy) dy = n+1; 
				if(xy < mp[j]||dz > mp[i]) continue;
				int l = max(xz,dz);
				int r = min(xy,dy);
				int ll = mp[i]-l;
				int rr = r-mp[j];
				ans += ll*rr;
			}
			else{
				int xz = f3[mp[i]];
				int xy = f4[mp[i]];
				int dz = f1[mp[j]];
				int dy = f2[mp[j]];
				if(!xy) xy = n+1;
				if(!dy) dy = n+1; 
				if(dy < mp[i]||xz > mp[j]) continue;
				int l = max(xz,dz);
				int r = min(xy,dy);
				int ll = mp[j]-l;
				int rr = r-mp[i];
				ans += ll*rr;
			}
		}
	}
	
	cout << ans;
	
	return 0;
	
}