#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long cal(long long n)
{
    long long m=(n+1),f=1,i;
    if(n==1)
        return 1;
    while(n!=1&&f==1)
    {
    for(i=2;i<=sqrt(n);i++)
    { if((n%i)==0)
        {
         m+=(n/i);
         n/=i;
         break;  
        }
    }
       if(i>sqrt(n))
           f=0;
    }   
     return m;
}
int main() {  
    int n;
    cin >> n;
    long long sum=0,s;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
     cin >> a[i];
     s=cal(a[i]);
     sum+=s;
    }
    cout<<sum;
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}