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

int isprime(long long int a)
{
    for(long long int i=2;i<=sqrt(a);i++)
    {
        if(a%i==0){
            return 0;
        }
    }
    return 1;
}
 long long int first(long long int a){
    for(long long int i=3;i<=a;i=i+2){
        if(a%i==0){
            return i;
        }
    }
    return a;
}
long long int longestSequence(int a_size, long int* a) {
    long long  int result=0;
    for(long long int i=0;i<a_size;i++)
    {
       if(a[i]==1){
           result=result+1;
       } 
        while (a[i]!=1)
        {
            if(isprime(a[i])){
                result=result+a[i]+1;
                a[i]=1;
            }
            else if (a[i]%2==0){
                result=result+a[i];
                a[i]=a[i]/2;
            }
            else{
                long long int k=first(a[i]);
                result=result+a[i];
                a[i]=a[i]/k;
                
            }
        }
    }
    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;
}