#!/bin/python3

import sys
from math import sqrt

def is_prime(n):
	if n ==1:
		return False
	for i in range(2,int(sqrt(n)+1)):
		if n%i==0:
			return False
	return True

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    res = 0
    for i in a:
        res += test(i)
    return res
   
def test(n):	
	divisors = []
	for i in range(2,n):
		if n%i==0:
			divisors.append(i)
	data = [1, n, n]  # num_nums, total, n
	def inner_helper(data, divisors):
			if data[2] == 1:
				return 	data[1]+data[0]
			elif is_prime(data[2]):
				return data[1]+data[0]
			else:
				data[1]=data[1]+data[0]
				data[0]=data[0]*divisors[-1]
				data[2]=data[2]//divisors[-1]
			divisors.clear()
			for i in range(2, n):
				if data[2]%i==0:
					divisors.append(i)
			return inner_helper(data, divisors)
	return inner_helper(data, divisors)

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