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

long prime(long x)
{
    long i;
    int c=0;
    for(i=2;i<x;i++)
    {
        if(x%i==0)
        {
            c=1;
            break;
        }
    }
    if(c==0)
        return true;
    else
        return false;
}
long high(long x)
{
    long temp=1,i;
    for(i=1;i<=x;i++)
    {
        if(x%i==0 && prime(i) && i>temp)
            temp=i;
    }
    return temp;
}
long longestSequence(long a) {
long x=high(a);
    long move=0;
   long y;
    y=a/x;
    move++;
    if(y>0 && a>1)
    {
    move=move+(x*longestSequence(y));
    }
       return move;
}

int main() {
    int n;
    
    cin>>n;
    long int result=0;
    vector<long int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin>>a[a_i];
    }
     for(int a_i = 0; a_i < n; a_i++){
    result=result+longestSequence(a[a_i]);
     }
    cout<<result<<endl;
    return 0;
}