#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
long int isPrime(long int a);

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int i, count, array[1],count1;
    count1=0;

    
    for (i=0;i<a_size;i++)
    {
        count=isPrime(a[i]); //if prime number itself is sent
        /*printf("ok %ld",count);*/
        if (count==a[i])
        {
            if (a[i]==1)
                count1++;
            else
                count1+=a[i]+1;
        }
        else
        {
            array[0]=a[i]/count;
            count1+=count*longestSequence(1,array)+1;
        }

    }
        
    return (count1);
}

long int isPrime(long int a)
{
    long int i,flag;
    flag=a;
    for (i=a-1;i>1;i--)
    {
        if (a%i==0)
        {
            flag=isPrime(i);
            return (flag);
        }
    }
    return (flag);
}

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]);
    }
    /*printf("ok");*/
    long int result = longestSequence(n, a);
    printf("%ld\n", result);
    return 0;
}