#!/bin/python3

import sys
def longestSequence(a):
    s = 0
    for j in a:
        s = s + 1
        b = j
        if j % 2 == 0:
            while b % 2 == 0:
                s = s + b
                b = b // 2

        if b != 1:
            for i in range(3, b+1, 2):
                while b % i == 0:
                    s = s + b
                    b = b // i
                    # if b==1:
                    #   break
    return s


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