#!/bin/python3



import sys

def isPrime(n):
    if n== 2 or n==3 :
        return True
    if n % 2 == 0 : return False
    for i in range(3,int(n**0.5)+1 , 2):
        if n % i == 0 : return False
    return True


def findSmallestFactor(n, i):
    if n % i == 0:
        return i
    elif i > n:
        return -1
    else:
        return findSmallestFactor(n, i + 1)


def greatestPrimeFactor(n):
    smallestFactor = findSmallestFactor(n, 2)
    for i in range(int(n / smallestFactor), 1, -1):

        if n % i == 0:
            if isPrime(i):
                return i
    return n






nocases = int(input().strip())
nums = input().strip().split()
nums = list(map(int,nums))
finallist = []




for num in nums:
    tosumlist = []

    if num == 1: tosumlist.append(0)
    elif isPrime(num):
        tosumlist.append(1)
    else:
        tosumlist.append(1)
        c = num
        while(not isPrime(c)):
            div = greatestPrimeFactor(c)
            tosumlist.append(tosumlist[len(tosumlist)-1]*div)
            c = c / div
    ans = sum(tosumlist) + num
    finallist.append(ans)

print(sum(finallist))


#print(greatestPrimeFactor(num))