/***
Author: ShivamRathore (Shivam010)
Problem: Breaking Sticks
***/
#include <bits/stdc++.h>
//#include <unordered_map>
using namespace std;
#define ll long long
#define mk make_pair
#define pb push_back
#define Pi pair<int,int>
#define Pl pair<long long,long long>
#define vi vector<int>
#define vl vector<long long>
#define vb vector<bool>
#define vp vector<pair<int,int> >
#define vpl vector<pair<long long, long long> >
#define F first
#define S second
const ll mod=1000000007;

ll ab(ll c){
    if(c<0) return -c;
    return c;
}

ll pow(ll a,ll b){
    ll p=a%mod,ans=1;
    while(b){
        if(b&1) ans=(ans*p)%mod;
        p=(p*p)%mod;
        b>>=1;
    }
    return ans;
}

ll gcd(ll a,ll b){
    if(b==0) return a;
    return gcd(b,a%b);
}

vb prim(1000002,1);
vi prime;
int siz=0;
void pri(){
    for(int i=4;i<1000002;i+=2) prim[i]=0;
    for(int i=3;i*i<=1000002;i++){
        if(prim[i])
            for(int j=i*i;j<1000002;j+=i) prim[j]=1;
    }
    for(int i=2;i<1000002;i++)
        if(prim[i]) prime.pb(i);
    siz=prime.size();
}

int main()
{
    int n;
    cin>>n;
    ll ans=0,t=0,s=0;
    pri();
    for(int i=0;i<n;i++){
        ll x;
        cin>>x;
        for(int j=0;j<siz && prime[j]*prime[j]<=x;j++){
            while(x%prime[j]==0){
                ans+=x;
                x/=prime[j];
            }
        }
        if(x>1)
            ans+=x;
        ans++;
    }
    cout<<ans<<endl;
    return 0;
}