#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

void longestSequence(long long int n, long long int *k)
{
    if(n==1)
        return;
    int choose = n/2;
    int max=1;
    for(int i=1; i<n; i++)
    {
        if(n%i==0&&i<choose&&i>max)
        {
            max=i;
        }
    }
    //cout<<"value of n --> "<<n<<" value of max --> "<<max<<" value of k --> "<<*k<<endl;
    *k= *k+1;
    for(int i=0; i< n/max; i++)
    {
        longestSequence(max,k);
    }
}


int main() {  
    int n;
    cin >> n;
  
    int maxa=0;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        long long int k=0;
        longestSequence(a[i], &k);
        maxa+=k+a[i];
    }
    cout<<maxa;
    
    
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}