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

long int longestSequence(long int a_size, long int* a) {
    long int num1,i,j,k=0,l,c=1,num,arr[1000];
    long int su=0;
    for(i=0;i<a_size;i++)
    {
        k=0;
        num=*a;
        if(num!=1)
        c=num+1;
        else
            c=1;
        num1=num;
        for(j=2;j<=num;j++)
        {          
            if(num1==1)
                break;
            while(num1%j==0)
            {
              arr[k]=j;
                num1/=j;
                k++;
            }
        }
        for(j=1;j<k;j++)
        {
            long int pr=1;
            for(l=j;l<k;l++)
            {
                pr*=arr[l];
            }
            c+=pr;
        }
         a++;   
        su+=c;
    }
    return su;
    //  Return the length of the longest possible sequence of moves.
}

int main() {
    long int n; 
    scanf("%ld", &n);
    long int *a = malloc(sizeof(long int) * n);
    for (long int a_i = 0; a_i < n; a_i++) {
       scanf("%ld",&a[a_i]);
    }
    long int result = longestSequence(n, a);
    printf("%ld\n", result);
    return 0;
}