#include<bits/stdc++.h>
using namespace std;
#define int long long    
#define vi vector<int>
#define vii vector<vi>
#define pb push_back
#define pir pair<int,int>
const int P = 1e9 + 7;
const int N = 1e6+7;
const int inf = 0x3f3f3f3f3f3f3f3f;//longlong
const int ing = 1e18;
//const int mod = 998244353;
//cout << fixed << setprecision(5) << number << endl;
//tuple
//prev(it)   next(it)
const int mod = 1e9+7;
int  n,m;
int ax, bx,ay,by;
bool st[N];
int pr[N];
void get(int n){
	for(int i=2;i<=n;i++){
		if(!st[i]){
			pr[++pr[0]]=i;
		}
		for(int j=1;pr[j]<=n/i;j++){
			st[pr[j]*i]=1;
			if(pr[j]%i==0)break;
		}
	}
	st[1]=1;
}
void solve()
{
	cin>>n;
	vector<int> a(n+1);
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	get(N);
	map<int,int> mp;
	int ans=0;
	for(int i=1;i<=n;i++){
		ax=a[i];
		for(int j=2;j<=ax;j++){
			if(!st[ax]){
				//cout<<ax<<"\n";
				if(!mp[ax])mp[ax]=-1;
				ans+=(n-i)*(i-mp[ax]);
				mp[ax]=i;
				break;
			}
			if(ax%j==0){
				while(ax%j==0)ax/=j;
				//cout<<j<<"\n";
				if(!mp[j])mp[j]=-1;
				ans+=(n-i)*(i-mp[j]);
				mp[j]=i;
			}
		}
	}
	cout<<ans<<"\n";
}
signed main()
{
	cin.tie(0)->sync_with_stdio(0);
	int _ = 1;
	//cin >> _;
	while (_--)
	{
		solve();
	}
}