#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 s, long * n) {
    //  Return the length of the longest possible sequence of moves.
    long count=0;
    for(long j=0;j<s;j++)
    {
        
    while (n[j]%2 == 0)
    {
        count=count+n[j];
         n[j] = n[j]/2;
        
     }   
      
    for (long i = 3; i <= sqrt(n[j]); i = i+2)
    {
        
        while (n[j]%i == 0)
        {
            count=count+n[j];
            n[j] = n[j]/i;
        }
    }  
    
 
   
 
    
    if (n[j]> 2)
    {
        count=count+n[j];
    }
        
        
    }
    return count;
   
}

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+n);
    return 0;
}