#!/bin/python3
from math import sqrt
import sys

mem_sequence = {1:1}
def sequence(a):
    a = int(a)
    global mem_sequence
    if mem_sequence.get(a,False):
        return mem_sequence[a]
    if a%2 == 0:
        mem_sequence[a] = a + sequence(a/2)
    else:
        for i in range(3,round(sqrt(a)+2),2):
            if a%i == 0:
                mem_sequence[a] = a + sequence(a/i)
                break
        else:
            mem_sequence[a]=a+1
    return mem_sequence[a]
    #  Return the length of the longest possible sequence of moves.
def longestSequence(a):
    s = 0
    for i in a:
        s+=sequence(i)
    return s

n = int(input().strip())
a = list(map(int, input().strip().split(' ')))
result = longestSequence(a)
print(result)