#!/bin/python3

import sys

def max(n, array):
    i=1
    pieces = 1
    moves = 0
    for a in array:
        moves += pieces
        pieces *= a
    return moves+pieces
    

def factors(n):
    f = []
    m=n
    while m>1:
        check = True
        for i in range(2,int(m**0.5)+1):
            if m%i==0:
                f.append(int(i))
                m = m / i
                check = False
                break
        if check:
            break
    if m > 1:
        f.append(m)
    return max(n, sorted(f, reverse=True))
        

def longestSequence(a):
    return sum(factors(x) if x > 1 else 1 for x in a)

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