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

long int longestSequence(int n, long int* a) 
{
    long int count = 0;
    for(int i = 0;i<n;i++)
    {
        long int innerC = 0;
        if(a[i] == 1)
        {
            innerC = 1;
        }
        else
        {
            long int brr[1000000] = {0};
            int j = 0;
            long int temp = a[i];
            while((temp % 2) == 0)
            {
                brr[j] = 2;
                temp = (temp / 2);
                j ++;
            }
            long int tempI = temp;
            for(long int k = 3;k<=(long int)sqrt(tempI);k=k+2)
            {
                while((temp % k) == 0)
                {
                    brr[j] = k;
                    temp = (temp / k);
                    j ++;
                }
            }
            if(temp > 2)
            {
                //printf("%ld ",temp);
                brr[j] = temp;
                j ++;
            }
            innerC = 1;
            long int mul = 1;
            j --;
            /*int p = 0;
            while(p <= j)
            {
                printf("%ld ",brr[p]);
                p ++;
            }*/
            temp = a[i];
            while(j >= 0)
            {
                mul = (mul * brr[j]);
                temp = (temp / brr[j]);
                innerC = (innerC + mul);
                j --;
            }
            //innerC = (innerC + a[i]);
        }
        count = (count + innerC);
    }
    return count;
    //  Return the length of the longest possible sequence of moves.
}

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;
}