#!/bin/python3
import math
import sys

def primeFact(a):
    arr = []
    while(a%2==0):
        arr.append(2)
        a = a/2
    for i in range(3, int(math.sqrt(a))+1, 2):
        while(a%i==0):
            arr.append(int(i))
            a = a/i
    if(a>2):
        arr.append(int(a))
    return arr

def longForAll(key):
    if(key==1):
        return 1
    arr = primeFact(key)
    arr = sorted(arr,key=lambda item:item, reverse=True)
    val = [arr[0]]
    for i in range(1,len(arr)):
        val.append(val[-1]*arr[i])
    return sum(val)+1

def longestSequence(a):
    val = 0
    for i in range(0,len(a)):
        val += longForAll(a[i])
    return val    

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