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

long int checkprime(long int h){
    int count=0;
    for(int i=2;i<h;i++){
        if(h%i==0){
            count++;
        }
    }
    if(count==0){
        return 1;
    }
    else
    {
        return 0;
    }
}
/*
long int just(int n){
    if(checkprime(n)==1){
        return n+1;
    }
    else
    {
        for(i=2;i<n;i++){
            if(n%i==0){
                int m=n/i;
                break;
            }
        }
        return m*i;
    }
}*/

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    int sum=0;
    for(int i=0;i<a_size;i++){
        if(checkprime(a[i])==1){
            sum += a[i]+1;
        }
        else
        {
            int k=a[i];
            int j=2;
            while(k>1){
                if(k%j==0){
                    int f=k/j;
                    sum += f*j;
                    k=k/j;
                    j=2;
                }
                else {
                    j++;
                }
            }
        }
    }
    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;
}