#include <bits/stdc++.h>

using namespace std;
int d[1000001];
vector <long> getAllFactor(long n){
    vector <long> res;
    for(long i=2;i<n;i++)
    {
        if(n%i==0)
         res.push_back(i);
    }
  return res;
            
}
bool isPrime(long n){
    bool res=true;
    for(int i=2;i<=sqrt(n);i++)
    
    {
        if(n%i==0)
        {
            res=false;
        }
    }
    
    return res;
}
long evaluate(long n)
{
    if(d[n]==-1)
    {if(n==1)
        return 1;
    else if(n==2)
        return 3;
   else if(isPrime(n)){
       d[n]=n+1;
       return n+1;
       
   }
    else{
        vector <long> p=getAllFactor(n);
        long max=-1;
        for(int i=0;i<p.size();i++)
        {  //cout<<"pi"<<p[i]<<endl;
            long ans=(evaluate(p[i])*(n/p[i]))+1;
                 if(max<ans)
                     max=ans;
        }
           d[n]=max; 
        return max;
        
    }
    }
   else return d[n];
    
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long count=0;
    for(long i=0;i<a.size();i++){
        count+=evaluate(a[i]);
        
        
    }
    return count;
    
}

int main() {
    int n;
    cin >> n;
    memset(d,-1,sizeof d);
    d[1]=1;
    d[2]=3;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
   
   
    cout << result << endl;
    return 0;
}