#!/bin/python

import sys

def longestSequence(a, n):
    sum = 0
    for x in a:
        sum = sum + maximumMoves(x)
    return sum
    #  Return the length of the longest possible sequence of moves.
    
def maximumMoves(n):
    return computeSum(primeDivisors(n), 1, 1)
    # Return maximum moves for any number n
    
    
def computeSum(m, acc, res):
    if(len(m) == 0):
        return res
    lastKey = m.keys()[-1]
    m[lastKey] = m[lastKey] - 1
    if(m[lastKey] == 0):
        del m[lastKey]
    acc = acc * lastKey
    res = res + acc
    return computeSum(m, acc, res)
    
def primeDivisors(n):
    res = {}
    i = 2;
    while(i <= n):
        if(n % i == 0):
            res[i] = res.get(i, 0) + 1
            n = n / i
        else:
            i = i + 1
    return res
    # Return map of prime divisors -- base as key and exponent as value

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