#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>

int64_t CountPrimeMoves(int64_t n) {
    int64_t moves = 0;
    for (int64_t i = 2; i <= n && i <= 1000000; ++i) {
        while (n % i == 0) {
            moves = 1LL + moves * i;
            n /= i;
        }
    }
    if (n > 1) {
        moves = 1LL + moves * n;
    }
    return moves;
}

int main() {  
    int n;
    std::cin >> n;
  
    std::vector<int64_t> a(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
  
    int64_t result = 0;
    for (int64_t value : a) {
        result += CountPrimeMoves(value) + value;
    }
    std::cout << result << std::endl;
 
    return 0;
}