#!/bin/ruby
require 'prime'

def find_prime(number)
  return 1 if number == 1
  Prime.prime_division(number).last.first
end

def recursion(element)
  return 1 if element == 1
  divisor = find_prime(element)
  return 1 + divisor if divisor == element
  1 + divisor * recursion(element / divisor)
end

def longestSequence(a)
  a.inject(0) do |sum, el|
    sum += recursion(el)
  end
end

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