#include <bits/stdc++.h>

using namespace std;

//long longestSequence(vector <long> a) {
    
    //  Return the length of the longest possible sequence of moves.
//}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    long result = 0;
    long arr[1000001] = {0};
    arr[0] = 1;
    arr[1] = 1;
    for(long i=2;i<=1000000;i++)
    {
    	//cout<<"i is : "<<i<<endl;
    	//if(arr[i]==0)
    	//{
    		if(arr[i]<(i+1))
    			arr[i] = i+1;
    		for(long j=i*2;(j<=1000000);j+=i)
    		{
    			if(arr[j]<((j/i)*arr[i] + 1))
    			{
    				arr[j] = (j/i)*arr[i] + 1;
    			} 
    		}
    	//}
    }
    for(int a_i = 0; a_i < n; a_i++){
        cin >> a[a_i];
        result+=arr[a[a_i]];
        
    }
    //long result = longestSequence(a);
    
    
    cout << result << endl;
    return 0;
}