#include <bits/stdc++.h>

using namespace std;
long pass(long no)
    {
        if(no==1)
            return 1;
        long val=LONG_MIN;
        for(long i=2;i<=sqrt(no);i++)
        {
            if(no%i==0)
                    {val=max(val,i+i*pass(no/i));
                        val=max(val,no/i+(no/i)*pass(i));
                    }
            }
   
        if(val==LONG_MIN)
       return no;
        
        
     return val;
    
    
    }
long longestSequence(vector <long> a,int n) {

    
    
        
    long count=0;
    for(int i=0;i<n;i++)
    {   if(a[i]==1)
        count++;
    else 
        count+=1+pass(a[i]);
    }
        
        return count;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}