#include <bits/stdc++.h>

using namespace std;

int is_prime(long long n)
{
if(n<=1)return 0;
if(n<=3)return 1;
if(n%2==0 || n%3==0)return 0;
for(long long i=5;i*i<=n;i=i+6)
{
if(n%i==0 || n%(i+2) == 0)return 0;
}
return 1;
}
long long longestSequence(vector <long> a) 
{
    
    long long result;
    for(long long i=0;i<a.size();i++)
    {

        if(a[i]>0)
        {
            while(a[i]!=0)
            {
                if(a[i]==1)
                {
                    result++;
                    a[i]=0;
                }
                else
                {
                    if(a[i]%2!=0)
                    {
                        long long k=is_prime(a[i]);
                        if(k==1)
                        { 
                            result=result+a[i]+1; 
                            a[i]=0; 
                        }
                        else
                        {

                            long long r=0;
                            for(long long j=3;j<a[i];j=j+2)
                            {
                                if(a[i]%j==0){ r = j; break; }
                            }
                            result = result + a[i];
                            a[i]=a[i]/r;
                        }


                   }
                    else
                    {
                        result+=a[i];
                        long long r=a[i]/2;
                        a[i]=a[i]/2;

                    }
                }
            }

        }  
       
    
    } 
     return result;
}
int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}