#!/bin/python

import sys
from math import sqrt

def fac(n):
    d = {}
    for i in range(2, int(sqrt(n))+1):
        while n%i == 0:
            if i in d: d[i] += 1
            else: d[i] = 1
            n = n / i
    if not n == 1: d[n] = 1
    return d

def m(n):
    d = fac(n)
    s = 0
    p= 1
    li = d.keys()
    li.sort(reverse=True)
    for i in li:
        for j in range(d[i]):
            s += p
            p = p * i
    return s+p
def longestSequence(a):
    i = map(m, a)
    return sum(i)
        

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