#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <climits>

#define ll long long

using namespace std;

ll primes[1000001];
unordered_map<long long,unordered_map<long long,long long> > dp;
long long func(long long x){
    long long ans=1;
    for(int i=2;i<=1000000&&x!=1;i++){
        if(x%i!=0)continue;

        ans=ans*i+1;
        x=x/i;
        i--;
    }
    if(x!=1)
        ans=ans*x+1;
   return ans;
}

int main(){

	int n;
	cin>>n;
	long long fans=0;
	for (int i=0;i<n;i++){
		ll x;
		cin>>x;
		ll ans=func(x);
		fans+=ans;
	}
	cout<<fans<<endl;
	return 0;
}