#!/bin/python3

import sys

def minDivisor(x):
    if x % 2 == 0:
        return 2
    else:
        for i in range(3, int(x**.5 + 1), 2):
            if x % i == 0:
                return i
    return x


def findDivisors(x):
    res = [1]
    while True:
        divisor = minDivisor(x)
        if divisor == 1:
            break
        res.append(divisor)
        x = x // divisor
    return res
    

def countForOne(x):
    steps = 0
    divisors = findDivisors(x)
    for d in divisors:
        x = x // d
        steps += x
    return steps    

def longestSequence(a):
    return int(sum(countForOne(x) for x in a))

if __name__ == "__main__":
    sys.setrecursionlimit(10000)
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)