#include <iostream>
#include <algorithm>
#include <time.h>
#include <stack>
#include <string>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>

using namespace std;

const int N = 500005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

int n;
long long answ;

long long solve(long long n){
    long long answ = 1;
    vector <long long> g;
    long long x = n;
    for(long long i=2;i*i<=n;i++){
        while(x % i == 0){
            x /= i;
            g.push_back(i);
        }
    }
    if(x > 1) g.push_back(x);
    long long T = 1ll;
    for(int i=(int)g.size()-1;i>=0;i--){
        T *= g[i];
        answ += T;
    }
    return answ;
}

int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        long long a;
        cin>>a;
        answ += solve(a);
    }
    cout<<answ<<endl;
	return 0;
}