#!/bin/python3

import sys
c=[0]
def prime1(t):
    for j in range(2,pow(t,0.5)+1):
        pass
def sum1():
    s=0
    for j1 in c:
        s=1+j1*s
    return s
def prime(i,p):
    s1=0
    j=3
    while(1):
        if j>=pow(i,0.5)+2:
            break
        if i%j==0:
            s1=1
            i=lon(i,j)
            if i==1:
                break
        j=j+2
    if i!=1:
        c.append(i)
    return sum1()
        
      
   
    
def lon(a,b):
    r=0
    while(r<=0):
        k=a
        r=a%b
        a=a//b
        if r==0:
            c.append(b)
    if r!=0:
        a=k        
    return a       
            
    #  Return the length of the longest possible sequence of moves.

if __name__ == "__main__":
    n = int(input().strip())
    a = list(map(int, input().strip().split(' ')))
    s=0
    for i in a:
        k =lon(i,2)
        s+=prime(k,3)
        c=[0]
    print(s)