#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define EB emplace_back
#define MP make_pair
#define all(o) (o).begin(), (o).end()
#define mset(m,v) memset(m,v,sizeof(m))
#define fr(i,n) for(lli i=0;i<n;++i)
#define rep(i,a,b) for(lli i=a;i<=b;++i)
#define per(i,b,a) for(lli i=b;i>=a;--i)
#define remin(a,b) (a=min((a),(b)))
#define remax(a,b) (a=max((a),(b)))
#define chartostr(x) string(1,(char)(x))
#define fastIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)

typedef long int li;typedef long long int lli;typedef long double ld;
typedef pair< lli,lli > ii;typedef pair<lli,ii> edge;
typedef vector<lli> vi;typedef vector<ii> vii;typedef vector<edge> edgelist;
typedef vector<vi> graph;lli MOD=1000000007;long double EPS=1e-9;

template <class T> inline T binpow(T p,T e,T M){lli ret = 1;for(; e > 0; e >>= 1){
if(e & 1) ret = (ret * p) % M;p = (p * p) % M;}return (T)ret;}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T modinverse(T a,T M){return bigmod(a,M-2,M);}
lli countbits(lli n){lli count=0;while(n){n = n&(n-1);count++;}return count;}
lli tolli(string s){lli sm;stringstream ss(s);ss>>sm;return sm;}
vi tobinary(lli n){vi bin;while(n){bin.EB(n%2);n/=2;};reverse(all(bin));return bin;}
#define debarr(a,n) for(int i=0;i<n;i++) cerr<<a[i]<<" "; cerr<<endl;
#define debmat(mat,row,col) for(int i=0;i<row;i++) {for(int j=0;j<col;j++) cerr<<mat[i][j]<<" ";cerr<<endl;}
#define pr(...) dbs(#__VA_ARGS__, __VA_ARGS__)
template <class S, class T>ostream& operator <<(ostream& os, const pair<S, T>& p) {return os << "(" << p.first << ", " << p.second << ")";}
template <class T>ostream& operator <<(ostream& os, const vector<T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}
template <class T>ostream& operator <<(ostream& os, const unordered_set<T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}
template <class S, class T>ostream& operator <<(ostream& os, const unordered_map<S, T>& p) {os << "[ "; for (auto& it : p) os << it << " "; return os << "]";}
template <class T> void dbs(string str, T t) {cerr << str << " : " << t << "\n";}
template <class T, class... S> void dbs(string str, T t, S... s) {int idx = str.find(','); cerr << str.substr(0, idx) << " : " << t << ","; dbs(str.substr(idx + 1), s...);}
template <class T> void prc(T a, T b) {cerr << "["; for (T i = a; i != b; ++i) {if (i != a) cerr << ", "; cerr << *i;} cerr << "]\n";}

void pre(){

}
lli ans=0;
void factorize(lli n){
	vi fact;
	lli temp=n;
	for(int i=2;i<=(int)sqrt(n);i++){
		while(temp%i==0){
			temp/=i;
			fact.EB(i);
		}
	}

	if(temp>1)fact.EB(temp);
	temp=1;
	ans+=temp;
	for(int i=fact.size()-1;i>=0;i--){
		temp*=fact[i];
		ans+=temp;
	}
}
void solve(){
	lli n,x;
	cin>>n;
	fr(i,n){
		cin>>x;
		factorize(x);
	}
	cout<<ans<<endl;
}

int main(){
	fastIO;
	pre();
	int t=1;
	//cin>>t;
	for(int i=1;i<=t;i++){
		solve();
	}
}