#!/bin/python3
__author__ = 'Tola'

import sys

def longestSequence(A):
    # find all prime nos btw 1:1000001
    prime = [2] * 1000001
    prime_list = [2]
    for i in range(3, 1000001, 2):
        if prime[i] == 2:
            prime[i] = i
            j = i
            while j * i < 1000001:
                if prime[i * j] == 2:
                    prime[i * j] = i
                j += 2
            prime_list.append(i)

    # compute
    large_sum = 0
    for a in A:
        if a == 1:
            large_sum += 1
            continue

        sum_instant = a

        # find lowest prime factor
        if a % 2 == 0:
            p = 2

        elif 2 <= a < 1000000:
            p = prime[a]

        else:
            for p_i in prime_list:
                if a % p_i == 0:
                    p = p_i
                    break
            else:  # a is a prime number
                p = a
        while p <= a:
            # print(p)
            sum_instant += (a // p)
            if p == a:
                break
            for q in prime_list:
                temp_p = p * q
                if a % temp_p == 0:
                    p = temp_p
                    break
            else:
                p = a
        # print("sum for", a, "is", sum_instant)
        large_sum += sum_instant
    return large_sum

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