#!/bin/python3

import sys


def seq(x):
    factors = []
    while x != 1:
        if x % 2 == 0:
            factor = 2
        else:
            for i in range(3, x+1, 2):
                if i*i > x:
                    factor = x
                    break
                if x % i == 0:
                    factor = i
                    break
        x //= factor
        factors.append(factor)
    factors.sort(reverse=True)
    moves = 0
    pieces = 1
    for f in factors:
        moves += pieces
        pieces *= f
    moves += pieces
    return moves

def longestSequence(a):
    return sum(map(seq, a))

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