#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    result = 0
 
    for num in a:
        num_div = num
        divisors = []
        divisor = 2

        while divisor * divisor < num_div:
            if num_div % divisor == 0:
                divisors.append(divisor)
                num_div //= divisor
            else:
                divisor += 1
        if num_div > 1: divisors.append(num_div)        

        moves = 1
        new_num = 1
        for mul in divisors[::-1]:
            new_num *= mul
            moves += new_num
        result += moves
    return(result)

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