#!/bin/python3

import sys
from math import sqrt

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    max_stick=max(a)
    primes=[2,3]
    result=0
    for i in range(5,int(sqrt(max_stick))+1,2):
        isPrime=True
        for j in primes:
            if i%j==0:
                isPrime=False
                break
            if j>sqrt(i):break
        if isPrime:primes.append(i)
    served={}
    for stick in a:
        if stick in served: result+=served[stick]
        else:
            tmp=stick
            res=0
            for prime in primes:
                while tmp%prime==0:
                    tmp=tmp//prime
                    res+=tmp
                    #print(stick,tmp)
                if prime>tmp:break
            res+=stick
            if tmp!=1:res+=1
            #print('tmp is ',tmp)
            result+=res
            served[stick]=res
    return(result)

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