#!/bin/python

import sys
import math


def prime_factorize(n):
    factors = []
    number = abs(n)
    factor = 2
    while number > 1:
        factor = get_next_prime_factor(number, factor)
        factors.append(factor)
        number /= factor
    if n < -1:
        factors[0] = -factors[0]
    return(factors)

def get_next_prime_factor(n, f):
    if n % 2 == 0:
        return(2)
    for x in range(max(f, 3), int(math.sqrt(n) + 1), 2):
        if n % x == 0:
            return(x)
    return(n)

def longestSequence(a):
    totalsum = 0
    for elem in a:
        pf = prime_factorize(elem)
        thistotal = elem
        if elem != 1:
            thistotal += 1
        carry = 1
        for i in sorted(pf, reverse = True)[:-1]:
            carry *= i
            thistotal += carry
        #print(thistotal)
        totalsum += thistotal
    return(int(totalsum))

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