#include <bits/stdc++.h>
#define MOD 1000000007
#define MAXA 10000000000000ll
#define PI 3.14159265358979323846264338327950
#define INF 0x3f3f3f3f
typedef long long int ll;
using namespace std;
const  int maxn=1e5+5;
const int N=1e6+5;
int a[maxn],prime[N+10];
bool vis[N+10];
int main()
{
    //freopen("AA.in","r+",stdin);
   //freopen("ou.txt","w+",stdout);
    int n,i,ans=0,j,x;
    prime[1]=1;
    for(i=2;i<=N;i++)
    {
        if(!vis[i])
        {
            prime[i]=i;
            for(j=2;j*i<=N;j++)
            {
                if(!vis[i*j])
                    {
                        prime[i*j]=i;
                        vis[i*j]=true;
                    }
            }
        }
    }
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>x;
        ans+=x;
        while(x!=1)
        {
           // cout<<x;
            ans+=x/prime[x];
            x/=prime[x];
        }
    }
    cout<<ans<<endl;
   return 0;

}