def getprime(n):
  l = [1]
  if n==1:return l
  while n%2==0:
    l.append(2)
    n/=2
  #print n
  i = 3
  while i<int(n**0.5)+1:
    while n%i==0:
      l.append(i)
      n/=i
    i+=2
  #print l
  if n>2:
    l.append(n)
  return l
n = int(raw_input())
t = map(int,raw_input().split())
count = 0
for h in t:
  n = h
  l = getprime(n)
  #print l
  prod = 1
  for i in l:
    prod*=i
    count+=(n/prod)
print count