#!/bin/python3

import sys
import math

def primeFactors(n):
    maxSum = 0
    while n % 2 == 0:
        n = n / 2
        maxSum += n

    for i in range(3,int(math.sqrt(n))+1,2):
        while n % i== 0:
            n = n / i
            maxSum += n
    
    if n > 2:
        maxSum += 1
    return maxSum

def longestSequence(a):
    maxSum = 0
    for aNum in a:
        if aNum == 1:
            maxSum += 1
            continue
        b = aNum+primeFactors(aNum)
        maxSum += b
    
    return int(maxSum)

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