#!/bin/python

import sys

def primes(n):
    primfac = []
    d = 2
    ans=1
    if n==1:
        return 1
    while d*d <= n:
        while (n % d) == 0:
            primfac.append(d)
            ans=1+ans*d# supposing you want multiple factors repeated
            n //= d
        d += 1
    if n > 1:
        ans=1+ans*n
        primfac.append(n)
    return ans

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    count=0
    for x in range(0,len(a)):
        count+=primes(a[x])
    return count

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