#include<bits/stdc++.h>
using namespace std;
typedef  long long LL;
typedef pair<char,int> PCI;
typedef pair<int,int> PII;
const int N=1000010,M=2000010;
const int mod=1e9+7;
int INF = 1e9;
int T=1;
int phi[N],st[N],primes[N],cnt;

void init(int n)
{
    phi[1] = 1;
    for (int i = 2; i <= n; i ++ )
    {
        if (!st[i])
        {
            primes[cnt ++ ] = i;
            phi[i] = i - 1;
        }
        for (int j = 0; primes[j] * i <= n; j ++ )
        {
            st[i * primes[j]] = true;
            if (i % primes[j] == 0)
            {
                phi[i * primes[j]] = phi[i] * primes[j];
                break;
            }
            phi[i * primes[j]] = phi[i] * (primes[j] - 1);
        }
    }
}

 
void solve(){
    int n;
    cin>>n;

    vector<int> a(n+10);

    for(int i=0;i<n;i++) cin>>a[i];

    map<int,vector<int>> mp;

    for(int i=0;i<n;i++){
        for(int j=0;primes[j]<=a[i];j++){
            bool sg=true;

            while(a[i]%primes[j]==0){
                if(sg){
                    mp[primes[j]].push_back(i);
                    sg=false;
                }
                a[i]/=primes[j];
            }
        }
    }
    LL res=0;
    for(auto [x,y]:mp){
        for(int i=0;i<y.size();i++){
            //cout<<x<<" "<<y[i]<<endl;
            if(i==y.size()-1) res+=(n-y[i])*(y[i]+1);
            else res+=(y[i+1]-y[i])*(y[i]+1);
        }
    } 


    cout<<res<<endl;
    

}

    
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //int T=1;
    //cin>>T;
    init(N-1);
    while(T--) solve();
 
    return 0;
}