//https://www.hackerrank.com/contests/world-codesprint-12/challenges/breaking-sticks

#include<bits/stdc++.h>
#define lli long long int
#define loop(a,b) for(int i=a;i<b;i++)
using namespace std;

int main()
{
    int n;
    cin>>n;
    lli a[n];
    loop(0,n)
        cin>>a[i];
    lli sum2=0;
    loop(0,n)
    {
        lli sqrtn = sqrt(a[i]), sum=0;
        sum+=a[i];
        while(a[i]%2==0)
        {
            a[i]=a[i]/2;
            sum+=a[i];
        }

        for(lli j=3;j<=sqrtn;j+=2)
        {
            while(a[i]%j==0)
            {
                a[i] = a[i]/j;
                sum+=a[i];

            }

        }


        if(a[i]>2)
            sum+=1;
        //cout<<sum<<endl;
        sum2+=sum;
    }
    cout<<sum2;
}