#!/bin/python3

import math

def longestSequence(a):   
    smallPrimes = getPrimes(math.ceil(math.sqrt(max(a))))
    print
    result = 0
    for num in a:
        result += getMoves(num, smallPrimes)
    return result

def getPrimes(num):
    listPrimes = []
    isPrime = [True for i in range(num + 1)]
    for i in range(2, num + 1):
        if isPrime[i] == True:
            listPrimes.append(i)
            for j in range(2 * i, num + 1, i):
                isPrime[j] = False
    return listPrimes

def getMoves(num, smallPrimes):
    factors = getFactors(num, smallPrimes)
    #print(num, factors)
    moves = 1
    for factor in factors:
        moves = moves * factor + 1
    return moves

def getFactors(num, smallPrimes):
    factors = []
    for i in smallPrimes:
        while num % i == 0:
            factors.append(i)
            num //= i
        if(num == 1):
            break
    if(num > 1):
        factors.append(num)
    return factors

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