#!/bin/python

import sys

from math import sqrt

def factors(n):
        step = 2 if n%2 else 1
        return set(reduce(list.__add__,
                    ([i, n//i] for i in range(1, int(sqrt(n))+1, step) if n % i == 0)))
    
def longestSequence(a):
    l = [0]* (max(a) + 1)

    l[1] = 1
    for i in range(2, len(l)):
        poss = list(factors(i))
        poss.remove(i)
        for j in range(len(poss)):
            poss[j] = l[poss[j]] * (i/poss[j])
        l[i] = max(poss) + 1
    counter = 0
    for i in a:
        counter += l[i]
    return counter
        

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