#include <bits/stdc++.h>
using namespace std;

long longestSequence(vector <long> a) {
    int n=a.size(),i,j;
    vector<long> p;
    bool arr[1000001];
    for(i=2;i<1000001;i++)
        arr[i]=false;
    for(i=2;i<=1000;i++)
        if(arr[i]==false)
        {
            p.push_back(i);
            for(j=i*i;j<1000001;j+=i)
                arr[j]=true;
        }
    long sum=n;
    for(i=0;i<n;i++)
    {
        vector<long> v;
        for(j=0;j<p.size() && a[i]>1;j++)
        {
            while(a[i]%p[j]==0)
            {
                v.push_back(p[j]);
                a[i]/=p[j];
            }
        }
        if(a[i]>1)
            v.push_back(a[i]);
        for(j=v.size()-1;j>0;j--)
        {
            sum+=v[j];
            v[j-1]*=v[j];
        }
        if(v.size()>0)
            sum+=v[0];
    }
    return sum;
}

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;
}