#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

int _;
ll x,ret;
int main() {
	for (scanf("%d",&_);_;_--) {
		scanf("%lld",&x);
		ret+=x;
		for (int i=2;(ll)i*i<=x;i++) while (x%i==0) {
			x/=i;
			ret+=x;
		}
		if (x!=1) ret+=1;
	}
	printf("%lld\n",ret);
}