#!/bin/python3

import sys
import math as m
def factor(n,prms):
    #for i in range(2, int(m.sqrt(n)) + 1):
    for i in prms:
        if n%i == 0:
            return n//i,i
    return n,1
def factors(n,prms):    
    resul=[]
    while n > 1:
        n,newf=factor(n,prms)
        if newf == 1:
            resul+=[n]
            break
        resul+=[newf]
    resul.sort()
    return resul       

def nume(x,prms):
    total,nivel=0,1
    facts=factors(x,prms)
    for x in reversed(facts):
        nivel = nivel*x
        total=total+nivel
    return 1+total

def genprimes(limit): # derived from 
                      # Code by David Eppstein, UC Irvine, 28 Feb 2002
    D = {}            # http://code.activestate.com/recipes/117119/
    q = 2

    while q <= limit:
        if q not in D:
            yield q
            D[q * q] = [q]
        else:
            for p in D[q]:
                D.setdefault(p + q, []).append(p)
            del D[q]
        q += 1
        
def longestSequence(a):
    p = genprimes(1000000)
    prms = [i for i in p]
    res=0
    while len(a)>0:
        res+=nume(a.pop(),prms)
    return res

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