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

int maxN = 1000000;
int *primes,num_primes;

int small[7+1] = {0,1,3,4,7,6,10,8};

//Simple prime sieve-generation up to x.
int gen_primes(int **primes,int x){
    int max_num,num_p,p,kp,i;
    char *A;
	A = (char *) malloc((x+1) * sizeof(char));

    max_num = (int)floor(sqrt((double)x));	
	num_p = 1;
	for(i=3;i<=x;i+=2) A[i] = 1;
	A[x] = x%2;
	for(p=3;p<=x;p+=2){
        if(A[p]){
            num_p++;
			if(p<=max_num){
				kp = p*p;
				while(kp<=x){
					A[kp]=0;
					kp+=p;
	            }
			}
        }
    }

    *primes = (int *) malloc(num_p * sizeof(int));
	(*primes)[0] = 2;
	for(i=1,p=3;p<=x;p+=2){
		if(A[p])
			(*primes)[i++] = p;
	}
    
    free(A);
    return num_p;
}

long int longestSequence(int size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int sum;
    long int fact[64],mul[64],numf,max_p;
    long int u,v;
    int i,j,k;
    sum = 0;

    for(i=0;i<size;i++){
//        printf("i: %d a: %ld\n",i,a[i]);
        if(a[i]<=7){
            sum += small[a[i]];
//            printf("sum: %ld\n",sum);
            continue;
        }
        v = a[i];
        max_p = ((long int) sqrt((double)v))+1;
        numf = 0;
//        printf("max_p: %ld\n",max_p);
        for(j=0;j<num_primes && primes[j]<=max_p;j++){
            if((v%primes[j])==0){
                fact[numf] = primes[j];
                mul[numf] = 1;
                v/=primes[j];
//                printf("fact: %d -> v: %ld\n",primes[j],v);
                while((v%primes[j])==0){
                    v/=primes[j];
                    mul[numf]++;
                }
                numf++;
            }
            if(v==1)
                break;
        }
        //
        if(v!=1){
            fact[numf] = v;
            mul[numf++] = 1;
        }
        
        u = 1; v = 1;
        for(j=numf-1;j>=0;j--){
            for(k=0;k<mul[j];k++){
                v *= fact[j];
                u += v;
            }
        }
        //
        sum+=u;
//        printf("sum: %ld\n",sum);
    }
    
    return sum;
}

int main() {
    int n; 
//    printf("start\n");
//    printf("sizeof(long int) = %d\n",sizeof(long int));
    num_primes = gen_primes(&primes,maxN);
//    printf("num_primes = %d, p[0] = %d\n",num_primes,primes[0]);
    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);
    free(primes);
    return 0;
}