#!/bin/python3

import os

def solve(x):
    os.system("factor {} > factors.txt".format(x))
    with open("factors.txt") as f:
        factors = [int(x) for x in f.read().split()[1:]]
        prod = 1
        ans = x
        for j in sorted(factors, reverse=True):
            ans += prod
            prod *= j
        return ans

def longestSequence(a):
    ans = 0
    for i in a:
        ans += solve(i)
    return ans

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