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

bool prime(int n){
    bool found =true;
    if(n==2)return true;
    for(long long int i=2;i<=sqrt(n)+1;i++){
        if(n%i==0){found=false;break;}
    }
    return found;
}

long long int sump(long long int k){
    if(k==1)return 1;
    else{
        long long int maxp;
        for(long long int i=k;i>1;i--){
            if(k%i==0&&prime(i)){maxp=i;break;}
        }
        return 1+maxp*sump(k/maxp);
    }
}

int main() {  
    int n;
    cin >> n;
    int sum=0;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum+=sump(a[i]);
    }
    cout<<sum<<endl;
    /* Enter your code here. Print output to STDOUT */   
    return 0;
}