#!/bin/python3

import sys

def prime_factors(n):
    i = 2
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
    return n

def fn(a):
    if a == 1:
        return 1
    prev = 1
    ans = 1
    while a != 1:
        x = prime_factors(a)
        ans += prev * x
        prev *= x
        a = a // x
    return ans

def longestSequence(a):
    ans = 0
    for a_i in a:
        ans += fn(a_i)
    return ans

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