#!/bin/python

import sys
import math

def primeFactors(n) :
    l = []
    if n == 1 :
        return [0]
    while n % 2 == 0:
        l.append(2)
        n = n / 2
    for i in range(3,int(math.sqrt(n))+1,2):
        while n % i== 0:
            l.append(i)
            n = n / i
    if n > 2:
        l.append(n)
    return l

def printDivisors(n) :
    l = []
    i = 1
    while i <= n :
        if (n % i==0) :
            l.append(i)
        i = i + 1


def longestSequence(a):
    c = 0
    l = []
    for i in a :
        for j in primeFactors(i) :
            c += j + 1
            l.append(c)
    return sum(l)

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