#!/bin/python3
import sys
ans=0
def findd(no,ans):
    if(no==1):
        return 1
    if(no%2==0):
        ans=ans+(no/2)
        ans=findd(no/2,ans)
    else:
        j=3
        k=0
        while((j*j)<=no):
            if no%j==0:
                k=1
                break
            j=j+2
        if k==1:
            ans=ans+(no/j)
            ans=findd(no/j,ans)
        elif k==0:
            ans=ans+1
            return ans
    return int(ans)
def longestSequence(a):
    res=0
    for i in a:
        res=res+findd(i,i)
    return res

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