#include<bits/stdc++.h>
using namespace std;
bool a[1000005];
vector<long long int>prime;
bool isprime(long long x)
{
    for(int i=0; prime[i]<=sqrt(x)&&i<prime.size(); i++)
    {
        if(x%prime[i]==0) return false;
    }
    return true;
}
long long  getfirst(long long x)
{
    vector<long long>div;
    for(int i=0; prime[i]<=sqrt(x)&&i<prime.size(); i++)
    {
        if(x%prime[i]==0)
        {
            div.push_back(prime[i]);
            if((prime[i]*prime[i])!=x) div.push_back(x/prime[i]);
        }
    }
    sort(div.begin(),div.end());
    return div[0];

}
long long  getfirst1(long long x)
{
    vector<long long>div;
    for(int i=0; prime[i]<=sqrt(x)&&i<prime.size(); i++)
    {
        if(x%prime[i]==0)
        {
            div.push_back(prime[i]);
            if((prime[i]*prime[i])!=x) div.push_back(x/prime[i]);
        }
    }
    sort(div.begin(),div.end());

    for(int i=0; i<div.size(); i++)
    {
        if(div[i]%2==1) return div[i];
    }
    return 2;
}
int main()
{
    memset(a,true,sizeof a);
    a[1]=false;
    for (int p=2; p*p<1000005; p++)
    {

        if (a[p] == true)
        {

            for (int i=p*2; i<1000005; i += p)
                a[i] = false;
        }
    }
    for(int i=1; i<=1000000; i++)
    {
        if(a[i]) prime.push_back((long long)i);
    }
    int n;
    scanf("%d",&n);
    long long ans=0;
    while(n--)
    {
        long long x;
        scanf("%lld",&x);
        long long steps=1;
        long long co=1;
        while(x!=1)
        {
            if(isprime(x))
            {
                // cout<<x<<endl;
                steps+=(co*(x));
                x=1;

            }
            else if(x%2==1)
            {
                long long first=getfirst(x);
                //cout<<first<<endl;
                steps+=(co*(x/first));
                co=x/first;
                x=first;

            }
            else
            {
                long long first=getfirst1(x);
                //   if(first==-1) first=2;
                //  cout<<steps<<endl;
                steps+=(co*(first));
                co*=first;
                x=x/first;

            }
        }

        // cout<<steps<<endl;
        ans+=steps;
    }
    cout<<ans<<endl;



}