#include <bits/stdc++.h>

using namespace std;
long prime[1000001]={0};
void sieve()
{
    long i,j;
    for(i=2;i<=1000;i++)
    {
        if(prime[i]==1)
            continue;
        for(j=i*i;j<=1000000;j+=i)
        {
            prime[j]=1;
        }
    }
}
bool isprime(long x)
{
    long i;
    for(i=2;i*i<=x;i++)
    {
        if(x%i==0)
            return false;
    }
    return true;
}
long spf(long x)
{
    long i;
    for(i=3;i<1000000;i+=2)
    {
        if(x%i==0)
            break;
    }
    return i;
}
long longestSequence(vector <long> a) 
{
    long ans=0;
    for(int i=0;i<a.size();i++)
    {
        if(a[i]==1)
            ans++;
        else if(a[i]%2==0)
            ans=ans+(1+a[i]+a[i]/2);
        else if(isprime(a[i])==true)
            ans+=1+a[i];
        else
        {
            long w=spf(a[i]);
            ans+=1+(a[i]/w)+a[i];
        }
       // cout<<ans<<endl;
    }
    return ans;
}

int main() {
    sieve();
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}