#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
     long sum,ts=0,i,n,prime;
    for(i=0;i<a.size();i++)
    {
     n=a[i];sum=a[i];
        while(n>1)
        {for (int j=2;j<=n;j++)
        {
        while(n%j==0)
        { n=n/j;sum+=n;}
        }}
        ts+=sum;} 
  return(ts);  
}

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