#!/bin/python

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.

    def helper(n):
        for i in range(2, n//2+1):
            if n%i == 0:
                return 1 + i + i * helper(n//i)
        return n

    ones = 0
    for x in a:
        if x == 1:
            ones += 1
    return sum([1 + helper(x) for x in a if x != 1]) + ones

if __name__ == "__main__":
    n = int(raw_input().strip())
    a = map(long, raw_input().strip().split(' '))
    result = longestSequence(a)
    print result