#!/bin/python

import sys

def primes():
    l = [True] * 1000001 * 9
    l[0] = l[1] = False
    for i in range(len(l)):
        if l[i]:
            for j in range(i * i, len(l), i):
                l[j] = False
    return tuple(i for i, x in enumerate(l) if x)

def factors(n):
    res = list()
    while n % 2 == 0:
        res.append(2)
        n /= 2
    for i in range(3, int(n**0.5) + 1, 2):
        while n % i == 0:
            res.append(i)
            n /= i
    if n > 2:
        res.append(n)
    return res

def handle(n, p):
    if n == 1:
        return 1
    res = n
    for x in p:
        n /= x
        res += n
    #while n > 1:
    #    for x in p:
    #       if n % x == 0:
    #           n /= x
    #            res += n
    #            break
    return res
        
def longestSequence(a):
    #p = primes()
    return sum(handle(x, factors(x)) for x in a)

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