#!/bin/python3

import sys


def prime(n) :
    i = 2
    if n==0 or n==1 :
        return False
    while i < n :
        if n%i == 0 :
            return False
        i += 1
    return True

def seq(a,k,prev_op):
    #print("calling a ",a,"calling k ",k,"calling prev_op ",prev_op)
    j =2 
    lis1 =[]
    while j<k :
        if k%j == 0:
            lis1.append(j)
        j += 1
     
    lis2 =[]
    for x in lis1 :    
        t = k//x
        if prime(t) == True :
            rev = prev_op
            rev *= x
            lis2.append( rev + a + 1 )
        else :
            rev = prev_op
            rev *= x
            lis2.append( rev + seq(a,t,rev) )
    return max(lis2) 
        
def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    total_sum = 0
    for L in a :
        if L == 1 :
            total_sum += 1
        elif prime(L) == True :
            total_sum = total_sum+1+L
        else    :
            total_sum += seq(L,L,1)
    return   total_sum    

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