#!/bin/python3

import sys

def isPrime(n):
    if n==2 or n==3: return True
    if n%2==0 or n<2: return False
    for i in range(3,int(n**0.5)+1,2):
        if n%i==0:
            return False

    return True

def numberofmoves(a):
    global r
    p=0
    if not 0<a<=10**6:
        return 0
    if a%2!=0:
        if isPrime(a)== True:
            return (1)
        elif a==1:
            return 0
        else:
            for i in range(a//2,2,-1):
                if a%i==0 and isPrime(i):
                    r=int(a//i)
                    c1=i;p+=1
                    break
            p=p+c1*numberofmoves(r)
            return p
    elif a==0:
        return 0
    elif a==2:
        return 1
    else:
        x=0
        global c2;
        for i in range(a//2,2,-1):
            if a%i==0 and isPrime(i):
                x=1
                p+=1
                r=a//i
                c2=i
                break
        if x==1:
            p=p+c2*numberofmoves(r)
            return p
        else:
            p+=1
            r=int(a//2)
            p=p+2*numberofmoves(r)
            return p


def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum=0
    for i in range(len(a)):
        sum+=numberofmoves(a[i])
    for j in a:
        sum+=j
    return sum

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