#!/bin/python3

import sys

def longestSequence(a):
    totc = 0
    for i in a:
        if i==1:
            totc+=1
        else:
            c=1+i
            dic = {}
            for j in range(2,round(i**(0.5))+1):
                if i%j==0:
                    dic[j] = i//j
                    if j!=(i//j):
                        dic[i//j] = j
            listn = [1]
            while bool(dic):
                item = max(zip(dic.values(), dic.keys()))
                listchecker = True
                for k in listn:
                    if item[1]%k!=0:
                        listchecker = False
                        break
                if listchecker:
                    listn.append(item[1])
                    c+=item[0]
                del dic[item[1]]
            totc+=c
    return totc

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