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

bool isPrime(long long int number){

    if(number < 2) return false;
    if(number == 2) return true;
    if(number % 2 == 0) return false;
    for(long long int i=3; i<=number/2; i+=2){
        if(number % i == 0 ) return false;
    }
    return true;
}

int main() {  
    long long int n,i,count=0;
    cin >> n;
    long long int arr[n];
    //for(i=0;i<n;i++)
    
    for(i=0;i<n;i++)
    {
        cin >> arr[i];
        int test=2;
        long long int temp=arr[i];
        //cout<<temp<<endl;
        if(isPrime(temp))
            count=count+temp+1;
        else
        {
            while(temp>1)
            {
                while(temp%test!=0)
                    test++;
                count=count+(temp/test);
                temp=temp/test;
            }
            count=count+arr[i];
        }
    }
    cout<<count;
    return 0;
}