#!/bin/python3

import sys

count=[]
move=0

def find_moves(n):
    count=0
    n=int(n)
    if n==1:
        count=0
    else:
        for i in range(2,n+1):
            if n%i==0:
                min_divisor=i
                break
            
        count = count + find_moves(n/min_divisor) + (n/min_divisor)

    return (count)

    
        
        

def longestSequence(a):

    for i in a:
        count[a.index(i)]= i + find_moves(i)
        
    sum=0
    for i in count:
        sum=sum+int(i)

    return (sum)
    #  Return the length of the longest possible sequence of moves.

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    for i in range(0,n):
        count.append(0)
    result = longestSequence(a)
    print(result)