#include <bits/stdc++.h>

using namespace std;
bool isPrime(int x){
    int count=0;
    int i=2;
    while(i<=sqrt(x)){
        if(x%i==0){
            count++;
        }
        i++;
    }
    if(count>=1){
        return false;
    }
    return true;
}
long findmindiv(int x){
    int i=2;
    do{
        if(x%i==0){
            return i;
        }
        i++;
    }while(i<x);
    return 0;
}
long longestSequence(vector <long> a) {
    int i=0,moves=0;
    for(i=0;i<a.size();i++){
        if(a[i]==1){
            moves=moves+1;
            continue;
        }
        moves=moves+a[i];
        int temp=a[i];
        while(isPrime(temp)!=true){
            int mindiv=findmindiv(temp);
            temp=temp/mindiv;
            moves=moves+temp;
        }
        moves=moves+1;
    }
    return moves;

    //  Return the length of the longest possible sequence of moves.
}

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