#!/bin/python3

import sys
from math import sqrt
def isPrime(n):
    for i in range(3, int(sqrt(n)+1),2):
        if n%i == 0:
            return False
    return True
def getPrimeComponent(n):
    result = n
    cur = 2
    while n!= 1 and n%2 == 0:
        n = int(n/2)
        result += n
    cur+= 1
    check = False
    while n!= 1:
        n1 = n
        while n%cur == 0:
            n = int(n/cur)
            result +=n
        cur += 2 
        if n1 != n:
            check = False
        if not check and n!= 1 and isPrime(int(n)):
            result += int(1)
            break
        else:
            check = True        
        
        
            
    return result
        

def longestSequence(a):
    final = 0
    for n in a:
        final += getPrimeComponent(n)
    return final
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)