#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long int primes(long long int n)
{
   long long int ans=n;
    while (n%2 == 0)
    {
       
        n = n/2;
        ans+=(n);
    }
 
 //  long long k=sqrt(n);
    for (long long int i = 3; i <= sqrt(n); i = i+2)
    {
        
        while (n%i == 0)
        {
          
            n = n/i;
             ans+=(n);
        }
    }
 
   
    if (n > 2)
    {
        ans++;
    }
    return ans;
}
int main() {  
    int n;
    cin >> n;
  long long int sum=0;
  for(int i=0;i<n;i++)
  {
     long long int a;
      cin>>a;
     sum+=(primes(a));
  }
    cout<<sum<<endl;
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}