#!/bin/python3

import sys
import math

def longestSeq(n):
    if n == 1:
        return 1
    nn = n
    seq = n
    k = math.floor(math.sqrt(n))
    i = 2
    while i <= k:
        if n % i == 0:
            #print("dividing",n,"by",i)
            n //= i
            k = math.floor(math.sqrt(n))
            seq += n
        else:
            i += 1
    #print("Max seq",seq+1,"for",nn)
    return seq+1
    

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    seq = 0
    for n in a:
        seq += longestSeq(n)
    return seq

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