#include <bits/stdc++.h>
#include<bitset>
using namespace std;

long long longestSequence(vector <long> a,long n) {
    //  Return the length of the longest possible sequence of moves.
    long long x,i=0,sum =0,l,f;
    while(i<n)
    {
        sum+=a[i];
        x =a[i];
            while(x)
            {   f=0;
                for( l = 2;l<=sqrt(x);l++)
            	   if(x%l==0)
            		  {f =1; break;}
                if(f==0&&a[i]==x)
                     { if(x!=1)sum++; break; }
                else if(f==0&&a[i]!=x)
                {sum++; x = 0;}
                 else if(x%2==0)
                 {
                     x/=2;
                     sum+=x;
                 }
                else
                {
                    x/=l;
                    sum+=x;
                }
            }
        i++;
      //  cout<<sum;
    }
    
    return sum;
}

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 long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}