#include<bits/stdc++.h>
using namespace std;
vector<int> sieve(int n){
    vector<int> v(1000000);

    for(int i=2; i*i<=1000000;i++){
        for(int j=2*i;j<=1000000;j+=i){
            v[j]=1;
        }
    }
    vector<int> primes;
    for(int i=2;i<=1000000;i++){
        if(v[i]==0){
            primes.push_back(i);
        }
    }
return primes;
    }
vector<int>prime=sieve(1000000);

int solve(int n){
    if(n==1){
        return 1;
    }
    int temp=INT_MIN;
    for(int i=0;i<prime.size();i++){
        if(n%prime[i]==0){
             if(temp<1+(prime[i]*(solve(n/prime[i])))){
              temp=1+(prime[i]*(solve(n/prime[i])));
             }

        }
    }
return temp;
}
int main(){
    int n,x;
    cin>>n;
    long long int sum=0;
    for(int i=0;i<n;i++){
        int x;
        cin>>x;
        sum+=solve(x);
    }
    cout<<sum<<"\n";
return 0;}