#!/bin/python3

import sys

def primes(n):
    if n < 2: return
    yield 2
    plist = [2]
    for i in range(3,n):
        test = True
        for j in plist:
            if j>n**0.5:
                break
            if i%j==0:
                test = False
                break
        if test:
            plist.append(i)
            yield i
def pfactors(n):
    for p in primes(n):
        while n%p==0:
            yield p
            n=n//p
            if n==1: return

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    summe = 0
    for i1 in a:
        if i1 == 1:
            summe += i1
            continue
        divi = list(pfactors(i1))
        last = 1
        result = 1
        for i in range(len(divi) - 1, 0, -1):
            last = last * divi[i]
            result += last
        result += i1
        summe += result
    return(summe)

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