#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define MOD 1000000007
#define forn(i,n) for(int i =0;i<n;i++)
#define mp make_pair
#define pb push_back
typedef long long ll;
const double PI=3.141592;
const int inf =(int) 1.01e9;
const double eps =(1e-9);
long longestSequence(vector <long> a) {
    vector<int> factors;
    long sumsum=0;
    for(int i =0 ; i<a.size() ; i++)
    {
    	for(long j =2 ; j <=a[i] ; j++){
    		if(a[i]%j==0){
    			factors.push_back(j);
    		}
    	}
    	/*
    	cout<<"factors "<<endl;
    	for(int j:factors){
    		cout<<j<<" ";
    	}

    	cout<<endl;*/
    	long temp=a[i];
    	long sum=a[i];
    	while(temp!=1){
    		for(int j=0;j<factors.size();j++){
    			if(temp%factors[j]==0){
    				temp/=factors[j];
    				sum+=temp;
    				break;
    			}
    		}
    	}
    	// cout<<sum<<endl;
    	sumsum+=sum;
    	factors.clear();
    }
    return sumsum;
}

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