#!/bin/python3

import sys


def factors(n):

    while n % 2 == 0:
        n //= 2
        yield 2

    j = 3
    while n > 1:
        for i in range(j, int((n+0.05)**0.5) + 1, 2):
            if n % i == 0:
                n //= i
                j = i
                yield i
                break
        else:
            if n > 1:
                yield n; break

#print [i for i in factors(12)]


def find(n):

    retVal = 1
    for f in factors(n):
        retVal *= f
        retVal += 1

    return retVal

def longestSequence(a):
    return sum(find(i) for i in a)

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