#!/bin/python3

import sys
import math

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

memoization = {}
primeMemoization = {}
primes = []
primeBools = [True for i in range(1000000)]
primeBools[0] = False
primeBools[1] = False

for i in range(1000000):
    if primeBools[i] != False:
        for j in range(i**2,1000000,i):
            primeBools[j] = False

for i in range(2,1000000):
    if primeBools[i]==True:
        primes.append(i)
        primeMemoization[i]=i+1
        
primeMemoization[1] = 1

def longestSequence(a):
    totalMoves = 0
    for num in a:
        totalMoves += calcMoves(num)
    return totalMoves

def calcMoves(num):
    curMoves = num
    curNum = num
    while curNum not in primeMemoization:
        for prime in primes:
            if curNum % prime == 0:
                curMoves += curNum//prime
                curNum = curNum//prime
                break
        else:
            primeMemoization[curNum] = curNum+1
    if curMoves>1:
        curMoves+=1
    return curMoves
        

result = longestSequence(a)
print(result)