#!/bin/ruby


require 'prime'



def wys(ln,nm,sm)
  return 1 if ln == 1
  if ln.prime?
    return sm + ln * nm
  end
  dv = ln.prime_division
  dd = dv.last[0]
  prts = ln / dd
  return wys(prts,nm*dd, sm + nm*dd)
end

def longestSequence(a)
    a.map{|x| wys(x,1,1) }.sum
end

n = gets.strip.to_i
a = gets.strip
a = a.split(' ').map(&:to_i)
result = longestSequence(a)
puts result