#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
 long int count=0;
long int prime_no(long int no)
{ long i=2; int flag=0;
    for( i=2;i<sqrt(no);i++)
    { if(no%i==0)
    { flag=1;
        break;
    }  
    }
     if(flag==1)
    return i;
     else return no;

}
long int partition(long int high)
{ long int i=0, b=high;
    while(high>1)
{long int no=prime_no(high);
   high=high/no;
 count=count+no*high;
 if(high==1)count=count+1;
}
 if(b==1)return 1; 
 return count;

}
long int longestSequence(int a_size, long int* a) {
    //  Return the length of the longest possible sequence of moves.
   //long int cs=0;
    for(int i=0;i<a_size;i++)
    {count=partition(a[i]);
 //     printf("\n%ld",count);
    }
        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);
    return 0;
}