#!/bin/python3
import math
import sys
def logD(x,n) :
    maxi=0
    i = 2
    while i <= math.sqrt(n) + 1 :
        if (n % i == 0) :
            if (n / i == i) :
                if math.log(i/x,x).is_integer():
                    if maxi<i:
                        maxi=i
            else :
                if math.log((i/x),x).is_integer():
                    if maxi<i:
                        maxi=i
                if math.log(((n/i)/x),x).is_integer():
                    if maxi<n//i:
                        maxi=n//i
        i = i + 1
    return maxi
def maximumD(x,n) :
    maxi=0
    i = 2
    while i <= math.sqrt(n) + 1 :
        if (n % i == 0) :
            if (n / i == i) :
                if (i/x).is_integer():
                    if maxi<i:
                        maxi=i
            else :
                if (i/x).is_integer():
                    if maxi<i:
                        maxi=i
                if ((n/i)/x).is_integer():
                    if maxi<n//i:
                        maxi=n//i
        i = i + 1
    return maxi
def minimumD(n) :
    divisor=[]
    i = 2
    while i <= math.sqrt(n) + 1 :
        if (n % i == 0) :
            if (n / i == i) :
                return i
            else :
                return i
        i = i + 1
    return 0
def longestSequence(a):
    sumar=0
    for i in range(len(a)):
        if a[i]==1:
            sumar+=1
        elif a[i]%2!=0:
            x=minimumD(a[i])
            if x==0:
                sumar+=(a[i]+1)
            else:
                maxi=maximumD(x,a[i])
                max2=logD(x,a[i])
                if maxi==0 and 0==max2:
                    sumar+= (1+a[i]+a[i]//x)
                elif max2==0:
                    sum1=0
                    sum1+=1+a[i]
                    while(maxi>=x):
                        sum1+=a[i]//maxi
                        maxi=maxi//x
                    sumar+= sum1
                else:
                    sum1=0
                    sum1+=1+a[i]
                    while(max2>=x):
                        sum1+=a[i]//max2
                        max2=max2//x
                    sumar+= sum1
        else:
            x=2
            max2=logD(2,a[i])
            maxi=maximumD(2,a[i])
            if maxi==0 and max2==0:
                sumar+= (1+a[i]+a[i]//2)
            elif max2==0:
                    sum1=0
                    sum1+=1+a[i]
                    while(maxi>=x):
                        sum1+=a[i]//maxi
                        maxi=maxi//x
                    sumar+= sum1
            else:
                sum1=0
                sum1+=1+a[i]
                while(max2>=x):
                    sum1+=a[i]//max2
                    max2=max2//x
                sumar+= sum1
    return sumar

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