#!/bin/python3
import math
import sys




def primes_method5(n):
    if n==2:
        return [2]
    elif n<2:
        return []
    s1 = list(range(3,n+1,2))
    mroot = n ** 0.5
    half=(n+1)//2-1
    i=0
    m=3
    while m <= mroot:
        if s1[i]:
            j=(m*m-3)//2
            s1[j]=0
            while j<half:
                s1[j]=0
                j+=m
        i=i+1
        m=2*i+3
    return [2]+[x for x in s1 if x]
l = primes_method5(1000000)


def longestSequence(a):
    li = a
    temp = 0
    s = 0
    flag = 0
    for i in range(len(li)):
       
        if li[i] == 1:
            flag = 1
            s += 1
        else:
            while li[i] > 1 :
                flag = 0
                for j in l:
                    if li[i]%j == 0:
                            # print('adi')
                        if li[i] == j:
                            s += li[i]+1
                            flag = 1
                            break
                        else:
                            s += li[i]
                            flag = 1
                                   # print(s,j)
                            break

                if flag == 1:    
                    li[i] = li[i]//j
                else:
                    break
                
        if flag == 0 :
            s += li[i]+1
                    
                    
        
    return s

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