#!/bin/python3

import sys

def prime_factors(n):
    i = 2
    factors = []
    while i * i <= n:
        if n % i:
            i += 1
        else:
            n //= i
            factors.append(i)
    if n > 1:
        factors.append(n)
    return factors

def check(x):
    s = 0
    if x == 1:
        return 1
    n = prime_factors(x) + [1]
    if n[0] == x:
        return x + 1
    n.reverse()
    for i in range(len(n)):
        p = 1
        for j in range(i + 1):
            p *= n[j]
        s += p
    return s

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    s = 0
    for x in a:
        s += check(x)
    return s

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