#include <bits/stdc++.h>

using namespace std;

long long longestSequence(vector <long long> a) {
    long long sum = 0;
    for(int i = 0 ; i < a.size(); i++){
        long long seq = a[i];
        while(seq > 0){
            bool check = false;
            for(int j = 2; j < 10; j++){
                if(seq % j == 0){
                    sum += seq;
                    seq = seq / j;
                    check = true;
                    break;
                }
            }
            if(seq == 1){
                sum += 1;
                break;
            }
            if(!check){
                sum += seq ;
                seq = 1;
            }else
                check = false;
        }
    }
    return sum;
}

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