#!/bin/python3

import sys

import functools

known_prime_factors = {}


def prime_factors(n):
    if n in known_prime_factors:
        return known_prime_factors[n]
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    known_prime_factors[n] = factors
    return factors

def longestSequence(a):
    _sum = 0
    for n in sorted(a):
        factors = sorted(prime_factors(n), reverse=True)
        factors.insert(0, 1)
        multipliers = [functools.reduce(lambda x, y: x * y, factors[:i]) for i in range(1, len(factors) + 1)]
        _sum += sum(multipliers)
    return _sum

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