#!/bin/python

import sys
import math

def factorize(n):
    arr=[]
    i=n
    j=2
    while(j*j<=i):
        if i%j==0:
            arr.append(j)
            i=i/j
        else:
            j+=1
    if i!=1:
        arr.append(i)
    return arr


def longestSequence(a):
    ans = 0

    for i in a:
        arr=factorize(i)
        if arr==[]:
            ans+=1
        elif len(arr)==1:
            ans+=arr[0]+1
        else:
            k=0
            l=len(arr)
            for j in range(l):
                k=(k+1)*arr[j]
            ans+=k+1


    return ans







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