#!/bin/python3

import sys

def 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)
    return factors
def calc(x):
    realx=x
    primecounter=0
    factors=[]
    primes=prime_factors(x)
    primes.append(realx)    
    while(x!=1):
        if(x%primes[primecounter]==0):
            x=x/primes[primecounter]
            factors.append(primes[primecounter])
        else:
            primecounter+=1
    total=0
    factors=factors[::-1]
    lastfact=1
    temp=0
    for i in range(len(factors)):
        temp=lastfact*factors[i]
        total+=temp
        lastfact=temp
    return total+1
def longestSequence(a):
    total=0
    c= max(a)
    for elem in a:   
        result =calc(elem)
        total+=result
    return int(total)    
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)