#include<bits/stdc++.h>
#define ll long long
using namespace std;

const ll N = 1000009;
vector<int> primes;

void seive(){
	bool pp[N]={0};
	for(int i=2; i<N; i++){
		if(pp[i]==false){
			primes.push_back(i);
			for(int j=2; i*j<N; j++){
				pp[i*j]=true;
			}
		}
	}
}

ll n, ans=0, tmp, rem;
ll arr[105];

int main(){
	seive();

	cin>>n;
	for(int i=1; i<=n; i++){
		cin>>arr[i];

		tmp=arr[i];
		for(int j=0; j<primes.size(); j++){
			while(tmp%primes[j]==0){
				tmp/=primes[j];
			}
		}
		rem=1;
		if(tmp!=1){
			ans+=rem;
			rem*=tmp;
		}
		for(int j=primes.size()-1; j>=0; j--){
			while(arr[i]%primes[j]==0){
				arr[i]/=primes[j];
				ans+=rem;
				rem*=primes[j];
			}
		}
		ans+=rem;
	}
	cout<<ans<<"\n";



}