#!/bin/python3

import sys

def longestSequence(a, memo):
    #  Return the length of the longest possible sequence of moves.
    su = 0
    for each in a:
    	su += magisk(each, 1 , memo)
    return su


def magisk(n, pieces, memo):
	n = int(n)
	if n in memo:
		return pieces*memo[n]
	splits = lpf(n)
	ssize = n / splits
	if splits == n:
		memo[n] = (n+1)

	else:
		memo[n] = 1+magisk(ssize, splits, memo)

	return pieces*memo[n]

def lpf(n):
    primeFactor = 1
    i = 2

    while i <= n / i:
        if n % i == 0:
            primeFactor = i
            n /= i
        else:
            i += 1

    if primeFactor < n:
        primeFactor = n

    return int(primeFactor)



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