#!/bin/python3

import sys
from math import sqrt

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    most = sum(a)
    for element in a:
        if element == 1:
            pass
        elif isprime(element):
            most += 1
        else:
            most += moves(element)
    return most

def moves(a, val=0):
    if isprime(a):
        return int(val + 1)
    for i in range(2, int(sqrt(a)) + 1):
        if a % i == 0:
            return moves(a/i, val + a/i)

def isprime(n):
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n%2 == 0 or n%3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n%i == 0 or n%(i+2) == 0:
            return False
        i += 6
    return True

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