#!/bin/python3

import sys
import math

def is_prime(n):
    if n % 2 == 0 and n > 2:
        return False
    if n == 2:
        return True
    for i in range(3, int(math.sqrt(n)) + 2, 2):
        if n % i == 0:
            return False
    return True

def least_prime_factor(n):
    if n % 2 == 0:
        return 2
    for i in range(3, int(math.sqrt(n)) + 2, 2):
        if n % i == 0:
            if is_prime(i):
                return i
            
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    steps = 0
    for i in a:
        if i == 1:
            steps += 1
        else:
            ni = i
            while ni != 1:
                lpf = least_prime_factor(ni)
                if lpf is None:
                    lpf = ni
                ni = ni // lpf
                steps += ni
            steps += i
    return steps

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