#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    long int i,j,s1,s2,number,result=0,count=0;
    for(i=0;i<a_size;i++)
{    s1=0;
     s2=0;
    number=a[i];
 if(number==1)
 { s1=1;}
else if(number%2==0 && number/2!=1)
{
     s2=number;
   while((s2/2)!=1)
  {   s2=s2/2;
     }
  s1=(number+number+1)-s2;
}

else
{
   for(j=3;j<=number/2;j=j+2)
    {   if(number%j==0)
         {  count=1;
             break;
            }
       }  
   if(count!=0)
  { for(j=3;j<=9;j=j+2)
      {  if(number%j==0)
                 s1=number+j+1;
          }
     }
   else
   { s1=number+1; }

}
  result=result+s1;       
}
     return result;  
}

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;
}