#include <bits/stdc++.h>

using namespace std;

int isprime(long x)
{
    for(int i=2;i<=sqrt(x);i++)
    {
        if(x%i==0)
            return 0;
    }
    return 1;
}

long calculate(long x)
{
    long d=x;
        
    while(isprime(x)==0)
          {
              long i;
              for(i=2;i<x;i++)
              {
                  if(x%i==0)
                      break;
              }
              
              x=x/i;
              //cout<<x<<endl;
              d+=x;
          }
          
          return d+1;
}

long longestSequence(vector <long> a)
{
    //  Return the length of the longest possible sequence of moves.
    long ans=0;
    for(long i=0;i<a.size();i++)
    {
         long x= a[i];
        if(x==1)
            ans+=x;
        
        else if(isprime(x)==1)
           ans+= x+1;
        
        else
            ans+= calculate(x);
        
       // cout<<ans<<endl;
         
    }
    return ans;
}

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;
}