#include<bits/stdc++.h>
using namespace std;
int64_t b[201];
const long long MAX_SIZE = 1000001;
vector<int64_t >isprime(MAX_SIZE , true);
vector<int64_t >prime;
vector<int64_t >SPF(MAX_SIZE);
 void sieve(int64_t N)
{
    isprime[0] = isprime[1] = 0 ;
 for (int64_t i=2; i<N ; i++)
    {
        if (isprime[i])
        {
            prime.push_back(i);
            SPF[i] = i;
        }
 for (int64_t j=0;
             j < (int64_t)prime.size() &&
             i*prime[j] < N && prime[j] <= SPF[i];
             j++)
        {
            isprime[i*prime[j]]=0;
            SPF[i*prime[j]] = prime[j] ;
        }
    }
}
int main()
{
    sieve(1000000);
    int n;
    cin>>n;
    int64_t a[n];
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }

    int64_t sum=0;
    for(int i=0;i<n;i++)
    {
        if(a[i]==1)
        {
            sum+=1;
        }
        else
        {
        sum+=a[i]+1;
        int64_t p=0;
        int64_t x=a[i];
        while(x!=1)
        {
            p++;
            if(x>prime[p-1])
            {
                if(x%prime[p-1]==0)
                {
                    x=x/prime[p-1];
                    sum+=x;
                    p=0;
                }
            }
            else
            {
                break;
            }
            if(p>=78498)
            {
                break;
            }
        }
        }
    }
    cout<<sum;
}