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

int smallest_divisor(int n){
    if(n%2==0) return 2;
    else {
        for(int i=3; i<=sqrt(n); i=i+2){
            if(n%i==0) return i;
        }
    }
    return 1;
}

long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
    int n=a_size;
    long int m,b,d,t=0;
    for(int i=0;i<n;i++){
        d=smallest_divisor(a[i]);
        if(d==1) {if(a[i]!=1) t+=a[i]+1; else t++; continue;}
        m=a[i];
        t+=m;
        while(m!=1){
        d=smallest_divisor(m);
        b=d;
        
        
        while(d<=m && d!=1){
            if(m%d==0) {
                b=d;
                t+=m/d;}
            d=d*d;
        }
        if(d==1){t++; b=m;}
        m=m/b;
        }
    }
    return t;
}

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