#!/bin/python3

import sys

def nprimes(n):
    # https://stackoverflow.com/questions/2068372/fastest-way-to-list-all-primes-below-n-in-python/3035188#3035188
    """ Returns  a list of primes < n """
    sieve = [True] * n
    for i in range(3,int(n**0.5)+1,2):
        if sieve[i]:
            sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)
    return [2] + [i for i in range(3,n,2) if sieve[i]]

primes = nprimes(10**6 + 1)


def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    result = 0
    for ai in a:
        factors = []
        for p in primes:
            if ai == 1:                
                break
            while ai % p == 0:
                factors.append(p)
                ai = ai // p
        if ai > 1:
            factors.append(ai)        
        acc = 1
        res = 1
       
        while(factors):            
            n = factors.pop()        
            res = res + n * acc
            acc *= n
        result += res
    return result
    

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