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

int primo(long long int n){
	if(n == 2|| n == 3)return -1;
	for(int i = 2; i<=sqrt(n); i++)
		if(n%i == 0) return i;
	return -1;
}

int f(int n, int num){
	if(n == 1)return num;
	long long ris = 0;
	int a = primo(n);
	//cout << a << " " << n << endl;
	if(a == -1) return num;
	a = n/a;
	ris += f(a, num) + a;
		return ris;
}


int main() {  
    int n;
    cin >> n;
  	long long ris = 0;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if(a[i] == 1) ris++;
        else ris += f(a[i], a[i])+1;
        //cout << ris << endl;
    }
  	cout << ris << endl;
    return 0;
}