#!/bin/python3

import sys

def bigprimediv(n):
    l = []
    i = 2
    while n != 1:
        if n % i == 0: l += [i]
        while n % i == 0: n //= i
        i += 1
    return max(l)
            
def split(a):
    if a <= 1: return 1
    else:
        s = 0
        d = 1
        while a != 1:
            s += d
            k = bigprimediv(a)
            d = d * k
            a //= k
        return s + d
def longestSequence(a):
    return sum(map(split, a))
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)