#!/bin/python3

import sys
def isprime(n):
    """Returns True if n is prime."""
    if n == 2:
        return True
    if n == 3:
        return True
    if n % 2 == 0:
        return False
    if n % 3 == 0:
        return False

    i = 5
    w = 2

    while i * i <= n:
        if n % i == 0:
            return False

        i += w
        w = 6 - w

    return True

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    count = 0 
    for num in a:
        if isprime(num) and  num !=1:
                count += num+1
        elif num == 1:
            count+=1
        else:
            count+=num
            div = 2
            while num != 1:
                while num%div==0:
                    num /= div
                    count+=num
                div+=1
    return int(count) 

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