#!/bin/python3

import sys

def factors(num) :
    primfac = []
    d = 2
    while d*d <= num:
        while (num % d) == 0:
            primfac.append(d)  
            num //= d
        d += 1
    if num > 1 :
        primfac.append(num)
    return primfac   

def magicNum(num) :
    sumT = num
    temp = factors(num)
    for i in range(len(temp)) :
        sumT += num//temp[i] 
        num = num//temp[i]
    return int(sumT)
        
def longestSequence(a):
    sumF = 0
    for j in a :
        temp = magicNum(j)
        sumF += temp
    return sumF
    
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)