#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> prime_factors(ll n){
	vector<ll> temp;
	while(n % 2 == 0){
		n /= 2;
		temp.push_back(2);
	}
	for(int i = 3; i <= sqrt(n); i++){
		while(n % i == 0){
			n /= i;
			temp.push_back(i);
		}
	}
	if(n > 2){
		temp.push_back(n);
	}
	return temp;
}
int main(){
  int n;
  scanf("%d", &n);
  ll arr[n + 10];
  ll ans = 0;
  for(int i = 0; i < n; i++){
  	scanf("%lld", arr + i);
  	ll res = 1;
  	ans += arr[i];
  	if(arr[i] == 1){
  		continue;
  	}
  	vector<ll> pfactors = prime_factors(arr[i]);
  	for(int j = 0; j < pfactors.size() - 1; j++){
  		res *= pfactors[j];
  		ans += arr[i] / res;
  	}
  	++ans;
  }
  printf("%lld\n", ans);
}