#!/bin/python


import sys

def funt(num,li):
    if(num ==1):
        return 1;
    else:
        n=li.pop()
        out= 1 + n*funt(num/n,li);
        return out;

def longestSequence(a):
    out=0;
    for n in a:
        i=2
        lis=[];
        while(i<=n):
            k=0
            if(n%i==0):
                j=2
                while(j<=(pow(i,0.5))):
                    if(i%j==0):
                        k=k+1
                    j=j+1
                if(k==0):
                    lis.append(i)
            i=i+1
        i=0;
        l=[];
        ques=n;
        while(ques>1):
            if(ques%lis[i]==0):
                l.append(lis[i]);
                ques=ques/lis[i];
            else:
                i=i+1;
        out=out+funt(n,l);
    return out;


    #  Return the length of the longest possible sequence of moves.

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result