#!/bin/python

import sys

def is_prime(k):
    for i in range(2, k**0.5 +1):
        if k % i == 0:
            return False
    else:
        return True

def largest_factor(k):
    for i in range(0, k/2):
        if k % i == 0:
            f = k
    return f
"""def largest_factor(k):
    f = 0
    for i in range(1, k/2+1):
        if k % i == 0:
            f = i
            print "z",f
    return f

i = 6
count = 0
p = 1
while i!= 0:
    f = largest_factor(i)
    print "a", f
    if f != 0:
        count += p*(i/f)
        p = i/f
    if f == 1 :
        count += i
    i = f
    print i
print count"""
def longestSequence(a):
    count = 0
    f = -1
    for i in a :
        if i == 1 or i is_prime(i):
            count+=1
        z = i
        while f!=0:
            f = largest_factor(i)
            count += i/f
            
    #  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