#!/bin/python

import sys

def getSubanswer(a_i):
    if a_i == 1:
        return 1
    
    answer = a_i
    
    while a_i % 2 == 0:
        a_i /= 2
        answer += a_i
    
    i = 3
    while i * i <= a_i:
        while a_i % i == 0:
            a_i /= i
            answer += a_i
        
        i += 2
    
    if a_i > 1:
        answer += 1
    
    return answer

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    answer = 0
    for a_i in a:
        answer += getSubanswer(a_i)
    return answer

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