#include <bits/stdc++.h>

using namespace std;

#define N 202

typedef long long ll;

long long n, vet[N];

long long solve(ll x){
	
	
	if(x == 1) return 1;
	vector<ll> div1, div2, div;
	
	for(ll i=2; i*i<=x; i++){
		if(x%i) continue;
		
		div1.push_back(i);
		if(i*i<x) div2.push_back(x/i);
	}
	div.resize(div1.size()+div2.size());
	reverse(div2.begin(), div2.end());
	merge(div1.begin(), div1.end(),  div2.begin(), div2.end(), div.begin());
	
	
	ll ans = x+1;
	ll val = 1;
	
	for(ll i=0; i<div.size(); i++){
		if(div[i]%val) continue;
		
		val = div[i];
		ans+= x/val;
	}
	return ans;
}


int main(){
	
	scanf("%lld", &n);
	ll ans=0;
	for(int i=0; i<n; i++) {
		scanf("%lld", &vet[i]);
		ans+= solve(vet[i]);
	}
	printf("%lld\n", ans);
	
	
}