#include <bits/stdc++.h>
using namespace std;
int main(){
    int N=pow(10,6)/2;
    long a[N+1];
    a[1]=1;
    for(int i=2;i<=N;i++){
        a[i]=i+1;
        for(int j=2;j<=sqrt(i);j++)
            if(i%j==0)
                a[i]=max(a[i],max(i*a[j]/j+1,j*a[i/j]+1));
    }
    int q;
    cin >> q;
    long ans=0;
    while(q--){
        long n,m;
        cin>>n;
        m=n;
        long gpf;
        while(m%2==0){
            gpf=2;
            m/=2;
        }
        for(int i=3;i<=sqrt(m);i+=2){
            while(m%i==0){
                gpf=i;
                m/=i;
            }
        }   
        if(m>2)
            gpf=m;
        if(n==1) ans+=1;
        else ans+=gpf*a[n/gpf]+1;
    }
    cout<<ans;
    return 0;
}