#!/bin/python3

import sys
import math

def findAllDivisors(x):
    divList = []
    y = 1
    while y <= math.sqrt(x):
        if x % y == 0:
            divList.append(y)
            divList.append(int(x / y))
        y += 1
    return divList

def longestSequence(n):
    if n == 1:
        return 1
    else:
        div = findAllDivisors(n)
        if len(div) == 2:
            return 1 + n * longestSequence(1)
        else:
            div = div[1:]
            val = [x * longestSequence(n // x) for x in div]
            #print(div)
            #print(val)
            m = max(val)
            i = val.index(m)
            #print('optimal is divide by ' + str(div[i]))
            return 1 + div[i] * longestSequence(n // div[i])

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = sum([longestSequence(x) for x in a])
    print(result)