#include <bits/stdc++.h>
using namespace std;
bool sorter (long long i,long long j) { return (i<j);} 
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n;
    long long p,sum=0,s1,pro,i,end,no;
    cin>>n;
    while(n--){
        cin>>p;
        vector<long long> v;
        while(p!=1){
            i=2;
            end=sqrt(p);
            while(p%i!=0&&i<=end)i++;
            if(i==end+1)i=p;
            v.push_back(i);p=p/i;
        }
        s1=0;
        if(!v.empty()){
            sort(v.begin(),v.end(),sorter);
            no=v.size()-1;
            pro=1;
            for(i=no;i>=0;i--){
                pro=pro*v[i];
                //cout<<pro<<" ";
                s1+=pro;
            }
        }
        sum+=(s1+1);
        //cout<<"\n"<<(s1+1)<<"\n";
        
    }
    cout<<sum;
    return 0;
}