# Enter your code here. Read input from STDIN. Print output to STDOUT
#!/bin/python

require 'prime'
def findfact(n)
    if Prime.prime?(n)
        return n
    else
	for x in 2...n+1
		if (n % x) == 0
			return x
			end
    end
	return n
    end
	end
def longestSequence(a)
    sum1=0
    for i in 0...a.length
        s=a[i]
        sum=0
        k=1
        l=0
        while(k)
            if(a[i]==1)
                sum1+=1
                l=0
                break
            elsif(Prime.prime?(a[i]))
                sum1+=a[i]+1
                l=0
                break
            else
                l=1
                b=findfact(s)
                if(b==s)
                    break
                  end
                f=s/b
            
                sum+=f
                s=f
                
              end
            end
        if(l==1)        
            sum1+=sum+1+a[i]
          end
        end
    print sum1
      end

  
    #  Return the length of the longest possible sequence of moves.


    n = gets.to_i
    a = gets.split.map(&:to_i)
    longestSequence(a)