#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) {
    long int sum=0;
    for(int i=0;i<a_size;i++)
    {
        if(a[i]%2==0)
        {
            if(a[i]==2)
                sum+=(a[i]/2)+a[i];
            else
                sum+=1+(a[i]/2)+a[i];
        }
        else
        {
            if(a[i]%3==0)
            {
                if(a[i]==3)
                    sum+=(a[i]/3)+a[i];
                else
                    sum+=1+(a[i]/3)+a[i];
            }
            else if(a[i]%5==0)
            {
                if(a[i]==5)
                    sum+=(a[i]/5)+a[i];
                else
                    sum+=1+(a[i]/5)+a[i];
            }
            else if(a[i]%7==0)
            {
                if(a[i]==7)
                    sum+=(a[i]/7)+a[i];
                else
                    sum+=1+(a[i]/7)+a[i];
            }
            else
                sum+=1+a[i];
        }
    }
    return sum;//  Return the length of the longest possible sequence of moves.
}

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