#!/bin/python

import sys

sequenceLengths = {1:1}

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    total = 0
    for stick in a:
        total += getSequenceLength(stick)
    return total

def getSequenceLength(L):
    if L in sequenceLengths:
        return sequenceLengths[L]
    best = 1 + L
    for i in xrange(2, L):
        if i**2 > L:
            break
        if L % i == 0:
            best = max([best, 1 + i * getSequenceLength(L // i), 1 + (L // i) * getSequenceLength(i)])
    sequenceLengths[L] = best
    return best

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