#!/bin/python

import sys

def getSmallestDivisor(length):
    smallest = 1
    for divisor in xrange(2, length/2):
        if length % divisor == 0:
            smallest = divisor
            break
    return smallest 
    
def getNumberMoves():
    res = [0] * 100
    res[0] = 0
    res[1] = 1
    res[2] = 3
    res[3] = 4
    res[4] = 7
    
    for lengthTotal in xrange(5, len(res)):
        maxi = lengthTotal + 1
        for lengthPart in xrange(1, lengthTotal/2 + 1):
            if  lengthTotal % lengthPart == 0:
                numberOfParts = lengthTotal / lengthPart
                maxi = max(1+numberOfParts*res[lengthPart], maxi)
        res[lengthTotal] = maxi
        #print "length = %d, lengthPart = %d, numberParts = %d" % (i, lengthPart, numberOfParts)
    return res 
        

def longestSequence(a):
    numberMoves = getNumberMoves()
    s = 0
    #print "moves[%d] = %d" % (4, numberMoves[4])
    #print "moves[%d] = %d" % (8, numberMoves[8])
    for x in a:
        #print "moves[%d] = %d" % (x, numberMoves[x])
        s += numberMoves[x]
    return s

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