#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum = 0
    primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
    n = len(primes)
    
    for nb_pieces in a :
        
        move_count = nb_pieces
        divisor=primes[0]
        i = 0
        while nb_pieces > 1:
            while nb_pieces%divisor != 0:                
                if i<(n-1):
                    i+=1
                    divisor=primes[i]
                else:
                    divisor+=2
            nb_pieces = nb_pieces // divisor
            move_count += nb_pieces
        sum += move_count
    return sum
    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)