#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
long int gd(long int p)
{
    if(p==1)
        return 1;
    long int x=0,m;
    m=p+1;
    for(int i=2;i<=p/2;i++)
    {
        if(p%i==0){
            long int temp=1+(p/i)*(gd(i));
            if(temp>m)
                m=temp;
        }
    }
    return m;
}
long int longestSequence(int a_size, long int* a) {
    long int moves=0;
    for(int i=0;i<a_size;i++)
    {
        moves+=gd(a[i]);
    }
    return moves;
    //  Return the length of the longest possible sequence of moves.
}

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