#!/bin/python3

import sys

def longestSequence(a):
    counter=0
    d=0
    for n in a:
        i = 2
        factors = []
        while i * i <= n:
            if n % i:
                i += 1
            else:
                n //= i
                factors.append(i)
        if n > 1:
            factors.append(n)
        d+=count(factors,-1,1)
    return d
def count(list,k,c):
    if ((-1)*(k))<=len(list):
        c*=list[k]
        return c+count(list,(k-1),c)
    else:
        return 1
if __name__ == "__main__":
    b = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)