#!/bin/python3

def get_number(number):
    if number == 1:
        return 1
    for i in range(2, number + 1):
        modulos = number % i
        division = int(number / i)
        if modulos == 0:
            return number + get_number(division)
    return 1 + number


def longestSequence(a):
    sum = 0
    for i in a:
        sum += get_number(i)
    return sum


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