#!/bin/python3

import sys
def max_divisor(i):
    if(i==1 or i==0):
        return i
        
    mid=int(i/2)
    for j in range(mid,0,-1):
        if i%j==0:
            return j
def longestSequence(a):
    sum1=0
    while(len(a)!=0):
            i=a[0]
            if i==1:
                a.remove(i)
                sum1+=1
            else:
                if i%2==0:
                    max_d=max_divisor(i)
                    sum1+=max_d
                    a.remove(i)
                    for j in range(max_d):
                        a.append(i/max_d)
            
                else:
                    max_d=max_divisor(i-1)
                    max_d+=1
                    sum1+=(max_d)
                    a.remove(i)
                    for j in range(max_d-1):
                        a.append(i/(max_d-1))
           
           
if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    result = longestSequence(a)
    print(result)