#include<bits/stdc++.h>
using namespace std;
int n;
long long max(long long a,long long b){
 if(a>b)return a;
    return b;
}
unordered_map<long long ,long long >dp;

vector<long long > getFactorization(long long  n)
{
  
    int count = 0;
 vector<long long>primes;
    // count the number of times 2 divides 
    while (!(n % 2)) {
        n >>= 1; // equivalent to n=n/2;
        count++;
    }
 
    // if 2 divides it
    if (count)
        primes.push_back(2);
 
    // check for all the possible numbers that can 
    // divide it
    for (long long i = 3; i <= sqrt(n); i += 2) {
        count = 0;
        while (n % i == 0) {
            count++;
            n = n / i;
        }
        if (count)
            primes.push_back(i);
    }
 
    // if n at the end is a prime number.
    if (n > 2)
        primes.push_back(n);

return primes;}



long long cal(long long n){
    
    long long ans=0;
    if(dp[n]!=0)return dp[n];
    if(n==1)return 1;
    vector<long long > primes=getFactorization(n);
    for(int i=0;i<primes.size();i++){
        if(n<primes[i])break;
        if(n%primes[i]==0){
       ans=max(ans,1+(primes[i])*(cal(n/primes[i])));
        }}
    
    return dp[n]=ans;}
int main(){
    cin>>n;
    vector<long long >a(n);
    long long z=0;
    for(int i=0;i<n;i++){cin>>a[i];z=max(z,a[i]);}
    long long total=0;
    for(int i=0;i<n;i++){
       total+=cal(a[i]);
    }
      cout<<total<<'\n';
    return 0;
    
}