#include <bits/stdc++.h>

using namespace std;
long long int prime[1000001];
vector<long long int> vec;
long long int loop;
#define loop 1000000
void soe()
{
    memset(prime,0,sizeof prime);
    long long int p,i;
    for(p=2;p*p<=loop;p++)
    {
        if(prime[p]==0)
        {
            for(i=p*2;i<=loop;i+=p)
            {
                if(prime[i]==0)
                    prime[i]=p;
            }
        }
    }
    for(i=2;i<loop+1;i++)
    {
        if(prime[i]==0)
            vec.push_back(i);
    }
}
void longestSequence(long long int n) {
    //  Return the length of the longest possible sequence of moves.
    long long int i,j,x,cnt=0;
    while(n--)
    {
        scanf("%lld",&x);
        if(x==1)
            cnt+=1;
        else if(x>1 && x<loop+1)
        {
            while(prime[x])
            {
                cnt+=x;
                x=x/prime[x];
            }
            cnt+=x+1;
        }
        else
        {
            long long int flag=0;
            for(i=0;i<vec.size();)
            {
                if(x%vec[i]==0)
                {
                    cnt+=x;
                    x=x/vec[i];
                    flag=1;
                }
                else
                {
                    i++;
                    flag=0;
                }
                 if(x<loop+1)
                {
                    flag=1;
                    while(prime[x])
                    {
                        cnt+=x;
                        x=x/prime[x];
                    }
                    cnt=cnt+x+1;
                }
            }
            if(flag==0)
                cnt=cnt+x+1;
            }
        }
    printf("%lld",cnt);
}

int main() {
    long long int n;
    scanf("%lld",&n);
    soe();
    longestSequence(n);
    return 0;
}