#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int f[1000001]={0},i,j,n,k,s=1,sum=1,a[10000000];
void sieve()
{   long long i, j;
    for(i = 4; i <= 1000000; i += 2) f[i] = 1;
    for(i = 3; i <= 1000001; i++) if(f[i] == 0)
    {
            for(j = i * i; j <= (long long)(1000000); j += i) f[j] = 1;
    }
}
int main() { 
    sieve();
    cin >> n;
    for(i=0;i<n;i++){
    	cin>>a[i];
    		while(a[i]!=1){
    			for(j=a[i];j>=2;j--){
    				if(f[j]==0 && a[i]%j==0){
    					s*=j;
    					sum+=s;
    					a[i]/=j;
    					break;
    				}
    			}
    		}
    }
    cout<<sum;
    return 0;
}