#!/bin/python3
import math
import sys
def prime_factors(n):
    factors = []
    i = 3
    while n % 2 == 0 :
        factors.append(2)
        n = n // 2
        
    
    while i * i <= n:
        if n % i:
            i += 2
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    t = 0
    for i in a:
        pr = 1 
        tt = 1 
        s = prime_factors(i)
        for j in range(1,len(s)+1):
            pr = pr * s[len(s)-j]
            tt += pr
        t += tt
    return t    
        
if __name__ == "__main__":
    k = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)