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

long long solve(long long num)
{
    std::vector<long long> f;
    while(num%2==0)
    {
        f.push_back(2);
        num /= 2;
    }
    for(long long i=3;i*i <= num; i+=2)
    {
        while(num%i==0)
        {
            f.push_back(i);
            num /= i;
        }
    }
    if(num>1)
        f.push_back(num);
    sort(f.begin(),f.end());
    // cout<<f.size()<<endl;
    long long prev = 1,sol=1;
    for(long long j=f.size()-1;j>=0;j--)
    {
        sol += prev*f[j];
        prev = prev*f[j];
    }
    return sol;
}

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