#!/bin/python3

import sys

def primeFactor(num):
    test = 2
    factors = []
    if num == 1:
        return [1]
    while test <= num**0.5:
        if (num % test) != 0:
            test += 1
        else:
            num /= test
            factors.append(test)
    if num != 1:
        factors.append(num)
    return factors

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    count = 0
    for num in a:
        #print("---")
        #print("New num")

        factors = primeFactor(num)
        if (len(factors) == 1):
            if (factors[0] == 1):
                count += 1
            else:
                count += factors[0] + 1
        else:
            s = 1
            factors.sort(reverse = True)
            while (1):
                #print(factors, "factors")
                #print(count, "count")
                #print(s, "s")
                count += s
                if (len(factors) == 0):
                    break
                s *= factors[0]
                factors.pop(0)
    return int(count)

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