#!/bin/python3

import sys

def sieve(limit):
	limit+=1
	prime=dict()
	
	for i in range(2, limit):
		prime[i]=True
	for i in prime:
		factors = range(i,limit,i)
		for f in factors[1:]:
			prime[f]=False
	return [i for i in prime if prime[i] == True]

def factorise(n):
    global stack
    for i in stack:
        if(n%i == 0):
            return (True,n//i)
    
    return (False,False)

def factor(a):
    sum_array=a
    while(True):
        result=factorise(a)
        if(result[0]):
            a=result[1]
            sum_array+=result[1]
        else:
            break
    return sum_array
        
        
def longestSequence(a):
    result=0
    for i in a:
        result += factor(i)
    return result

stack = sieve(1000)
n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
result = longestSequence(a)
print(result)