#!/bin/python

import sys
import math

def maxPrimeFactors(n):
    
    factors = []
    d = 2
    while n > 1:
        while n % d == 0:
            factors.append(d)
            n /= d
        d = d + 1
        if d*d > n:
            if n > 1: factors.append(n)
            break
    return max(factors)

def sequence(a):
    
    if(a==1):
        return 1
    elif(a==2):
        return 3
    else:
        prime = maxPrimeFactors(a)
       
        return (1+prime*sequence(a/prime))

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum = 0
    for v in a:
        sum+=sequence(v)
    return sum

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