#include<iostream>
#include<algorithm>
#include<vector>
#include<deque>
#include<unordered_map>
#include<cstring>
#include<ctime>
using namespace std;

#define sz(x) (int)(x.size())
#define fi(a,b) for(int i=a;i<b;++i)
#define fj(a,b) for(int j=a;j<b;++j)
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
//////////////////////

int const N = 141;

int n;
ll a[N], ans;

ll f(ll n){
	vector<ll> pd;
	for(int i=2;i*1LL*i<=n;++i){
		while(n % i == 0){
			pd.pb(i);
			n /= i;
		}
	}
	if(n != 1) pd.pb(n);
	if(sz(pd) == 1) return n + 1;
	sort(pd.begin(), pd.end());
	ll res = 1;
	fi(0, sz(pd)){
		res = res * pd[i] + 1;
	}
	return res;
}


void solve(){
	fi(0, n) ans += f(a[i]);
}

int main(){
	srand(41);
#ifdef _DEBUG
	freopen("input.txt","r",stdin);
	freopen("output.txt","w",stdout);
#endif

	scanf("%d",&n);
	fi(0, n) scanf("%lld",&a[i]);

	solve();

	printf("%lld\n",ans);

	return 0;
}