#!/bin/ruby

def longestSequence(a)
    max_move = 0
    a.each {|ele| max_move+=findMaxMove(ele) }
    max_move
end

def findMaxMove(ele)
    n = leastDividingPrime(ele)
    if (ele==1)
        return 1
    elsif (ele==n)
        return ele+1
    else
        return ele + findMaxMove(ele/n)
    end
end

def leastDividingPrime(n)
    root = Math.sqrt(n).to_i
    i = 2
    while(i<=root && n>=i)
        return i if n%i==0
        i+=1
    end
    return n
end

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