#!/bin/python3
import sys
def moves(m):
    result = m
    while m%2 == 0:
        m = m//2
        result += m
    while m%3 == 0:
        m = m//3
        result += m
    i=1
    while 36*i*i <= m+1: 
        k = 6*i - 1
        while m%k == 0:
            m = m//k
            result += m
        k = 6*i + 1
        while m%k == 0:
            m = m//k
            result += m
        i += 1
    if m > 2:
        result+=1
    return result

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

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