#!/bin/python3

import sys, math

def prime_factors(n):
    primes = [] 
    while n % 2 == 0:
        primes.append(2)
        n = n // 2
    for i in range(3,int(math.sqrt(n))+1,2):
        while n % i == 0:
            primes.append(i)
            n = n // i
    if n > 2:
        primes.append(n)
    return primes

def longestSequence(a):
    #divide by prime factors in order of factor size, largest first, to maximize the number of moves
    #for example, if n = 2*5*13 then moves incriments as follows: 1 + 13 + 13*5 + 13*5*2
    total = 0
    for stick in a:
        moves = 1
        total += moves       
        p = prime_factors(stick)
        p.sort(reverse = True)
        for i in range(0, len(p)):
            moves *= p[i]
            total += moves
    return total                       

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