#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int prime(long int n)
{
    int i, flag=0;
    for(i=(n/2); i>2; i--)
    {
        if(n%i== 0){
            flag=1;
            break;
        }
    }
    if(flag==1) return i;
    else return 0;
}
long int longestSequence(int n, long int a[]){
    //  Return the length of the longest possible sequence of moves.
    long int sum=0;
    int i;
        for(i=0; i<n; i++)
        {
            if(a[i] == 1) sum+=1;
            else{
                while(a[i]%2 ==0){
                    sum+= a[i];
                    a[i]/=2;
                }
                if(a[i]==1) sum+=1;
                else{
                    while(prime(a[i])){
                        sum+=a[i];
                        a[i]= prime(a[i]);
                    }
                    sum+= a[i]+1;
                }
            }
        }
        return sum;
}

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