#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){
    unsigned long long int i;


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

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

    return 1;
}

int main() {
    unsigned long long int n,sum=0;
    unsigned long long int sqn;
    scanf("%lli", &n);
    unsigned long long int *a = malloc(sizeof(unsigned long long int) * n);
    for (unsigned long long int a_i = 0; a_i < n; a_i++) {
       scanf("%lli",&a[a_i]);
        //printf("%d\n",prime(a[a_i]));
   }
     for(unsigned long long int i=0;i<n;i++)
    {
        sum+=a[i];
         if(a[i]==2){
             sum++;
             a[i]=1;
         }
      
        while(a[i]!=1)
        {
            
            if(a[i]%2==0)
            {
                sum+=a[i]/2;
                a[i]=a[i]/2;
            }
            if(a[i]%2!=0 && prime(a[i])==0)
            {
                
                sqn=floor(sqrt(a[i]));
               
                for(unsigned long long int j=3;j<=sqn;j+=2)
                    if(a[i]%j==0){
                        sum+=a[i]/j;
                        a[i]=a[i]/j;
                        break;
                    }
            }
            if(prime(a[i])){
                sum+=1;
                break;
            }
            //printf("%d\n",sum);
                
        }
    }
    
    
   printf("%lli\n",sum);

    
   
    return 0;
}