#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    sum = 0
    for i in range(0,len(a)):
        n = a[i]
        j=1
        sum = sum+n
       
        if n!=1:
             while j<n and n!=1: 
                j = j+1
                if n%j==0:
                    n = n/j
                    sum = sum+n
                    j=1
        
    return sum   

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