#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.
    int i,j,sum=0,p,r,c=0;
    for(i=0;i<a_size;i++)
    {
    	p=a[i];
        sum=sum+p;
        if(p!=1)
        {
        
       		 for(j=1;j<=p;j++)
       		 {
        		if(p%j==0)
        		c++;
        	}
        	if(c>2)
        	{
        	
        		while(p>0)
        		{
        			
        			r=p%2;
        			sum+=(p/2)-r;
        			
        			p=(p/2)-r;
        			r=0;
        		}
        		sum=sum+1;
    		}
    		else
    	    sum=sum+1;
    	    
    	   c=0;
  		  }
  	//	  printf("%d",sum);
    }
    return sum;
}
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;
}