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

long int prime(long int n)
{
    int i;
    if(n<=1)
        return -1;
    for(i=2;i<=(n/2);i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;
}
long int longestSequence(int a_size, long int* a) {
    long int s=0;
    int i;
    for(i=0;i<a_size;i++)
    {
        long int t=a[i],k=sqrt(a[i]),f1[100005],f2[100005],l1=0,l2=0,s1=1,s2=1;
        long int j=2;
        while(j<=k)
        {
                if(t%j==0)
                {    
                        f1[l1]=j;
                        l1++;
                      t /= j;
                }
            else
            {
                j++;
            }
        }
        if(t!=1)
        {
            s2 = s2*t;
            s1 += s2;
        }
        for(j=l1-1;j>=0;j--)
        {
            s2 = s2*f1[j];
            s1 += s2;
        }
        s+=s1;
    }
    return s;
}

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