#include <math.h>
#include <stdio.h>
//#include <string.h>
#include <stdlib.h>
//#include <assert.h>
//#include <limits.h>
//#include <stdbool.h>

int primes[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151,  157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};
int numPrimes = 168 ;

int binarySearch (int *array, int left, int right, int value) {
    if (right < left) {
        return -1;
    }
    int mid = (left+right)/2;
    while (right >= left) {
        if (array[mid] == value) return mid;
        else if (array[mid] > value) right = mid-1;
        else left = mid+1;
        mid = (left+right)/2;
    }
    return -1;
}

int isPrime (long int n) {
    int isPrime = 1;
    if (n < 1000) {
       if (binarySearch(primes, 0, numPrimes-1, n) >= 0) return 1;
       else return 0;
    }
    
    long int sqrtn = (long int) sqrt(n);
    for (int i = 2; i <= sqrtn+1; i++) {
        if (n % i == 0) {
            isPrime = 0;
            break;
        }
    }
    return isPrime;
}

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int longest = 0;
    
    for (int i = 0; i < a_size; i++) {
        long int n = a[i];
        long int longestPerElem = n;
        long int s = (long int) sqrt(n);
        int currPrime = 2;
        int firstTime = 1;
        int primeIndex = 0;
        
        if (isPrime(n)) {
            longestPerElem++;
            longest += longestPerElem;
            continue;
        }
        
        while (n > 1) {
           while (n % currPrime != 0) {
               if (primeIndex < numPrimes-1) {
                   primeIndex++;
                   currPrime = primes[primeIndex];
                   continue;
               } 
               currPrime += 2;
               while (!isPrime(currPrime)) currPrime += 2;
           }
           
           if (firstTime) {
               longestPerElem++;
               firstTime = 0;
               n = n/currPrime;
               continue;
           }
           longestPerElem += n;
           n = n/currPrime;
        }
        longest += longestPerElem;
    }
    return longest;
}

int main() {
    int n; 
    scanf("%i", &n);
    long int *a = malloc(sizeof(long int) * n);
    for (int a_i = 0; a_i < n; a_i++) {
       scanf("%li",&a[a_i]);
    }
    long int result = longestSequence(n, a);
    printf("%ld\n", result);
    return 0;
}