#!/bin/python3

import sys
import math

cache = {}
cache[1] = 1

def largest_prime_factor(n):
    i = 2
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n = n // i
    return n

def longestSequence(a):
    #print("a = ", a)
    if a in cache:
        #print("a in cache: ", cache[a])
        return cache[a]
    else:
        primeFactor = largest_prime_factor(a)
        result = 1 + primeFactor * longestSequence(int(a / primeFactor))
        cache[a] = result
        return result
    
def count(numList):
    result = 0
    for num in numList:
        result += longestSequence(num)
    return result

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