#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

#define INF_LL (ll)1e18
#define INF (int)1e9
#define REP(i, n) for(int i = 0;i < (n);i++)
#define FOR(i, a, b) for(int i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
using ll = long long;
using PII = pair<int, int>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

ll res = 0;
int n;
vector<ll> prime;
bool isP[1000100];

int main(void){
	cin.tie(0);
	ios::sync_with_stdio(false);
	REP(i, 1000100){
		isP[i] = 1;
	}
	isP[0] = isP[1] = 0;
	FOR(i, 2, 1000100){
		if(isP[i]){
			prime.push_back(i);
			for(int j = 2;j*i < 1000100;j++){
				isP[i*j] = 0;
			}
		}
	}
	cin >> n;
	REP(i, n){
		ll a;
		cin >> a;
		vector<ll> p;
		REP(j, prime.size()){
			while(a%prime[j] == 0){
				p.push_back(prime[j]);
				a /= prime[j];
			}
		}
		ll ret = 1;
		p.push_back(a);
		if(a != 1)
			p.push_back(1);
		reverse(all(p));
		REP(j, p.size()){
			ret *= p[j];
			res += ret;
		}
	}
	cout << res << endl;
}