#!/bin/python3
import sys
from math import sqrt; from itertools import count, islice
def isPrime(n):
    return n > 1 and all(n%i for i in islice(count(2), int(sqrt(n)-1)))

def longestSequence(a):
    last = max(a)
    group = []
    group.append(1)
    group.append(1)
    for i in range(2, last+1):
        if (isPrime(i)):
            suma = i+1
            group.append(suma)
        else:
            num = i
            maxa = 0
            for j in range(2, (i//2)+1):
                if (num%j==0):
                    x = num//j
                    suma = group[j]*x+1
                    maxa = max(maxa, suma)
            group.append(maxa)
    total = 0
    #print (group)
    for i in a:
        #print (group[i])
        total += group[i]
    return total

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