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

#define MAXN   1
 
// stores smallest prime factor for every number
int spf[MAXN];
 
// Calculating SPF (Smallest Prime Factor) for every
// number till MAXN.
// Time Complexity : O(nloglogn)
void sieve()
{
    for (int i=1; i<MAXN; i++)
        // marking smallest prime factor for every
        // number to be itself.
        spf[i] = i;
 
    // separately marking spf for every even
    // number as 2
    for (int i=4; i<MAXN; i+=2)
        spf[i] = 2;
 
    for (int i=3; i*i<MAXN; i+=2)
    {
        // checking if i is prime
        if (spf[i] == i)
        {
            // marking SPF for all numbers divisible by i
            for (int j=i*i; j<MAXN; j+=i)
                // marking spf[j] if it is not 
                // previously marked
                if (spf[j]==j)
                    spf[j] = i;
        }
    }
}

long int longestOne(long int a) {
    long int sum = a, d = 1;
    while (!(a&1)) {
        a >>= 1;
        fprintf(stderr, "%ld\n", a);
        sum += a;
    }
    while (a > MAXN) {
        d += 2;
        if (d*d > a)
            return sum+1;
        while (a%d == 0) {
            a /= d;
            fprintf(stderr, "%ld\n", a);
            sum += a;
        }
    }
    /*while (a!=1) {
        a /= spf[a];
        fprintf(stderr, "%ld\n", a);
        sum += spf[a];
    }*/
    return sum;
}

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int result = 0;
    for (int i=0; i<a_size; ++i)
        result += longestOne(a[i]);
    return result;
}

int main() {
    sieve();
    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;
}