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

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    
    long long result = 0;
    
    for(int i = 0; i < n; i++) {
        long long num = a[i];
        vector<long long> factors;
        
         while(num%2 == 0) {
             factors.push_back(2);
             num = num/2;
         }
        
        for(long long j = 3; j <= sqrt(num); j+=2) {
            if(num%j == 0) {
                while(num%j == 0) {
                    factors.push_back(j);
                    num = num/j;
                }
            }
        }
        
        if(num > 2) {
            factors.push_back(num);
        }
        
        long long tempresult = 1;
        long long tempsum = 1;
        for(long long j = factors.size()-1; j >= 0; j--) {
            tempresult = tempresult*factors[j];
            tempsum += tempresult;
        }
        result += tempsum;
    }
    
    cout << result << endl;
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}