#!/bin/python3
import math

import sys

def prime_numbers(limit=1000000):

    yield 2
    sub_limit = int(limit**0.5)
    flags = [True, True] + [False] * (limit - 2)
    # Step through all the odd numbers
    for i in range(3, limit, 2):
        if flags[i]:
            continue
        yield i
        # Exclude further multiples of the current prime number
        if i <= sub_limit:
            for j in range(i*i, limit, i<<1):
                flags[j] = True
b=list(prime_numbers())

def longestSequence(a):
    c = b[:a+1]


    bar_count=1
    moves=0
    for e in range(1,len(c)+1):
        while a%c[-e]==0:
            a=a/c[-e]
            moves+=bar_count
            bar_count*=c[-e]
    moves+=bar_count
    return moves
result=0
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    for i in a:
        one = longestSequence(i)
        result+=one
    print(result)