#!/bin/python

import sys

def largestprimedivisor(a):
    factors = []
    d = 2
    while a > 1:
        while a % d == 0:
            factors.append(d)
            a /= d
        d += 1
        if d**2 > a:
            if a > 1:
                factors.append(a)
            break
    return factors[-1]
    
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    globalcount= 0
    for el in a:
        count = 0
        original = el
        moves = 1
        while el > 1:
            largest = largestprimedivisor(el)
            count += moves
            el = el/largest
            moves *= largest
        count += original
        globalcount += count
        
    return globalcount
    
if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result