import sys if sys.version_info[0]<=2: range=xrange input=raw_input def primefactors(n): if n<2: return [] pskip=( 1,2,2,4,2,6,4,8,2,10,4,12,2,14,4,16,6,18,2,20,6,22,4,24,2,26,4, 28,6,30,6,32,2,34,6,36,4,38,2,40,6,42,4,44,6,46,8,48,4,50,2,52,4, 54,2,56,4,58,8,60,6,62,4,64,6,66,2,68,4,70,6,72,2,74,6,76,6,78,4, 80,2,82,4,84,6,86,2,88,6,90,4,92,2,94,4,96,2,98,10,100,2,102,10,8 ) S=[0]*n.bit_length() cnt=0 p,skip=2,0 while p*p<=n: if n%p==0: n=n//p while n%p==0: n//=p S[cnt]=p cnt+=1 p+=pskip[skip] skip=pskip[skip+1] if n>1: S[cnt]=n cnt+=1 return S[:cnt] def solve1(n): if n<2: return n fact=primefactors(n) moves=0 cnt=1 for i in range(len(fact)-1,-1,-1): d=fact[i] while n%d==0: moves+=cnt n//=d cnt*=d return moves+cnt n=int(input().strip()) arr=map(int,input().strip().split()) s=0 for a in arr: s+=solve1(a) print(s)