#include <cmath>
#include <cstdio>
#include <vector>
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long int ll;
ll ans(ll number)
{
        int i;
        for (i = 2; i <=sqrt(number); i++)
        {
            if (number % i == 0)
            {
                return number/i;
            }
        }
        return 1;
    
}
int main() {  
    ll n;
    cin >> n;
  
    vector <ll> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    ll sum=n,i;
    for(i=0;i<n;i++)
    {
        ll x=a[i];
        if(a[i]>1)
        sum+=a[i];
      ll div=ans(a[i]);
        while(div!=1)
        {
            sum+=div;div=ans(div);
        }
    }
    cout<<sum<<"\n";
    return 0;
}