#!/bin/python

import sys
def longestSequence(a):
    return sum(map(_longestSequence, a))

def _longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    v = int(a**0.5 + 1)
    Q = []
    for p in [2, 3]:
        while a % p == 0:
            Q.append(p)
            a /= p
    p = 5
    while a > 1 and p < v:
        while a % p == 0:
            Q.append(p)
            a /= p
        p += 2
        while a % p == 0:
            Q.append(p)
            a /= p
        p += 4
    if a > 1:
        Q.append(a)
    ans = 1
    for p in Q:
        ans *= p
        ans += 1
    return ans
    
    

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