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

long longestSequence(vector <long> a) {
    int x=a.size();
    long sum=0;
    for(int i=0;i<x;i++)
    {
       
          if(a[i]==1)
          {  sum++;continue;}
        
          if(a[i]==2)
          {  sum+=3;continue;}
          while(a[i]!=1)
            {
               long sq=sqrt(a[i]);
                 if(a[i]==2)
                 {
                     sum+=3;
                     break;
                 }
                else if(a[i]%2==0)
                {
                    sum+=a[i];
                    a[i]/=2;
                }
                else
                {
                     long c=1,f=0;
                    for(int j=3;j<=sq;j++)
                    {
                        if(a[i]%j==0)
                        {
                            c=j;
                            f=1;
                            break;
                        }
                    }
                    if(f)
                        sum+=a[i],a[i]/=c;
                    else
                    {
                        sum+=(a[i]+1);
                        break;
                    }
                }
              
                }
            
        }
    return sum;
    }


int main() {
    int n;
    cin >> n;
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    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;
}