#include <bits/stdc++.h>
#define m (long)1e6

using namespace std;

long f(long n,bool *c)
{
    long i=2,an=0;

    double x=(double)sqrt(n);

    while(n>1)
    {
        if(i<=m)
        {
        if(c[i])
        {
        while(c[i]&&i<=(long)x&&n%i>0)
        i++;
        }

        }

        else if(i>m)
        {//cout<<"P";
        an+=(n);
        return an;
        }

        while(n%i==0)
        {
            an+=n;
            n/=i;
        }

        i++;
    }

    return an;
}

int main()
{
    bool c[m+1];

    fill(c,c+m+1,0);

    long i,j,k;

    for(i=2;i<=m;i++)
    {
        if(!c[i])
        {
        for(j=i*2;j<=m;j++)
        c[j]=true;
        }
    }

    long n;

    cin>>n;

    long an=0;

    while(n--)
    {
        long x;
        cin>>x;

        an+=(1+f(x,c));

      //  cout<<an<<endl;
    }

    cout<<an;

    return 0;
}

/*
3 1 7 24
1 50
*/