#!/bin/python

import sys
import math
sq = [i for i in range(1000001)]
sq[1]=0
for i in sq[2:]:
    if i!=0 and i!=1:
        for j in range(i*i,len(sq),i):
            sq[j] = 0
sq = [i for i in sq if i!=0]        
    
def longestSequence(a):
    total = 0
    for i in a:
        total+=i
        if i==1:
            continue
        total+=1
        while i>=0:
            flag = False
            for j in sq:
                if math.sqrt(i)<j:
                    break
                if i%j==0:
                    i=i/j
                    total+=i
                    flag = True
                    break
            if flag:
                continue
            else:
                break
    return total
            
            
    #  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