#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 y)
{
  //  if(y == 2)return 1; 
    
for(int i=2; i<=sqrt(y); i++)
if(y%i == 0)
{
    //int u = y/i;
    return y/i ;
}

return 1; 
}
long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    
    int move =0, n = 0;
   // long int m=0;
    
    for(int i=0; i<a_size ; i++)
    {
        n=a[i];
        
    while(n!=1)
    {
        move+=n;
        n = prime(n);
       
        
     //   printf("%d\n",n);
    }//while(n!=1);
        move++;
        
}
    return move;
}


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