#!/bin/python3

import sys
from functools import reduce

def factors(x):
    return set(reduce(list.__add__,([i,x//i] for i in range(1,int(x**0.5)+1) if x%i==0)))

def longestSequence(a):
    sum = 0
    l =[0,1]
    for i in range(2,max(a)+1):
        f = sorted(list(factors(i)))
        if len(f)==2:
            l.append(i+1)
        else:
            mov = list(map(lambda x:l[i//x]*x + 1,f[1:]))
            l.append(max(mov))
    for x in a:
        sum = sum + l[x]
    return sum

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