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

unsigned long long int divisor(unsigned long long int number)
    {
        unsigned long long int i;
        for (i = 2; i <sqrt(number); i++)
        {
            if (number % i == 0)
            {
                break;
            }
        }
        return number/i;
    }

unsigned long long int isPrime(unsigned long long int n){
    unsigned long long int i;

    if (n==2)
        return 1;

    if (n%2==0)
        return 0;

    for (i=3;i<=sqrt(n);i+=2)
        if (n%i==0)
            return 0;

    return 1;
}

unsigned long long int longestSequence(unsigned long long int a_size, unsigned long long int* a) {
    unsigned long long int sum=0,temp;
    for(int i=0;i<a_size;i++)
    {
        unsigned long long int ele=a[i];
        if(ele==1)
        {
            sum++;
            continue;
        }
        while(ele>1)
        {
            if(isPrime(ele))
            {
                sum+=1+ele;
                break;
            }
            else
            {
                sum+=ele;
                ele=divisor(ele);
            }
        }
    }
    return sum;
    //  Return the length of the longest possible sequence of moves.
}

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