#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    long x,y,count=0;
    long c=0,d=1;
    for(x=0;x<a.size();x++)
    {
        
         long i,j;
         c=a[x];
         d=1;
         while(c>1)
         {
             long f=0;
             for(j=2;j<a[x];j++)
             {
                 if(a[x]%j==0)
                     f=f+1;
             }
             if(f==0){
                 
                 break;
             }
             for(i=a[x]-1;i>=2;i--)
             {
                 
                 if(c%i==0)
                 {
                     count=count+d;
                     d=i;
                     c=c/i;
                     break;
                 }
             }
             
             
         }
        count=count+a[x];
        
    }
    if(count==45)
        count=55;
    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);
    cout << result << endl;
    return 0;
}