#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum=0
    for i in a:
        if i==1:
            sum+=1
            continue
        var=i
        list=[x for x in [2,3,5,7,11,13] if i%x==0]
        factor=min(list)
        sumlist=[]
        sum+=var;#sumlist.append(var)
        while var%factor==0:
            var/=factor
            sum+=var
            #sumlist.append(var)
            #if var==1:
        if var==1:
            continue
        else:
            sum+=1
        #sumlist.append(1)
        #print(sumlist)
    return int(sum)
 
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)