#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int moves(int num)
{
   int m=1;
    int p=1;
    while(num!=1)
    {
        int root=sqrt(num);
        if(num%2!=0){root--;}
        while(num%root!=0 && root>1)
        {
            root-=2;
            if(root<2){
                root=1;
                break;
            }
        }
       if(root<2){
           root=1;
       }
        
            p*=(num/root);
            m=m+p;
            num=root;
        
    }
    cout<<m<<endl;
    return m;
}

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int sum=0;
    for(int i=0;i<n;i++)
    {
        sum=sum+moves(a[i]);
    }
    cout<<sum<<endl;
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}