#!/bin/python

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    total = 0
    primes = primes_to_n(max(a) ** 0.5)
    for n in a:
        factors = factor(n, primes)
        count = 1
        curr_prod = 1
        for p in reversed(factors):
            curr_prod *= p
            count += curr_prod
        total += count
    return total

def primes_to_n(n):
    n = int(n)
    primes = list(range(n + 1))
    primes[0] = None
    primes[1] = None
    for i in range(2, int(n ** 0.5) + 1):
        for x in range(2*i, n+1, i):
            if primes[x]:
                primes[x] = None
    return filter(None, primes)

def factor(n, primes):
    factors = []
    curr_index = 0
    while n > 1:
        if curr_index < len(primes):
            p = primes[curr_index]
            if n % p == 0:
                factors.append(p)
                n /= p
                continue
            else:
                curr_index += 1    
        else:
            factors.append(int(n))
            break
    return factors
            
    
if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result