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

int main() {
    int n; 
    scanf("%i", &n);
    unsigned long long int *a = malloc(sizeof(unsigned long long int) * n);
    for (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;
}