#!/bin/python

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    le = len(a)
    moves = 0

    for i in range(0,le):
        moves += getMoves(a[i])
        
    return moves
        
        
def getMoves(ch):
    # need highest 2^x that divides ch
    sum_ = 1
    temp = ch
    pieces = 1
    piece_size = ch
    while piece_size>1:
        
        pieces_ = getHighestPF(piece_size)
        piece_size = piece_size/pieces_
        pieces = pieces * pieces_
        sum_ += pieces
        
    
    #sum_ += pieces
    return sum_

def getHighestPF(n):
    
    d = 2
    highest_pf = d
    while (d < n):
        while (n%d ==0):
            n /= d
            highest_pf = d
        
        d += 1
        if d%2==0:
            d+=1
        if d*d > n :
            if n > 1 :
                highest_pf = n
            break
    return highest_pf
        
        
        
        
    
    
    

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