#!/bin/ruby
require 'prime'

def factors(n)
    n.prime_division.reverse.flat_map { |factor, power| [factor] * power }
end

def maximum_move(stick)
    a = 1
    factors(stick).map { |factor| a *= factor }.sum + 1
end

def longestSequence(a)
    total_moves = 0
    a.each do |stick|
        total_moves += maximum_move(stick)
    end
    total_moves
end

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