#!/bin/python3

import sys
import math

def primegen(x):
    num=math.floor(math.sqrt(x))
    primelist=[]
    primelist.append(2)
    for p in range(3,num+1):
        for k in range(2,p):
            flag='prime'
            if p%k==0:
                flag='notprime'
                break
        if flag=='prime':
            primelist.append(p)
    return primelist


def succ_div(x):
    if x>1:
        primelister=primegen(x)
        for elem in primelister:
            if x%elem==0:
                q=int(x/elem)
               
                return x+succ_div(q)
            if x%elem!=0:
                if elem==primelister[len(primelister)-1]:
                    return x+1
    elif x==1:
        return 1
        
        
            
        
        
            
def longestSequence(a):
    summer=0
    for i in range(len(a)):
        k=succ_div(a[i])
        summer=summer+k
    return summer
        
    

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