#!/bin/python3

import sys
import math

factorpairs={}
seqlens={}

def factorpair(a):
    if a in factorpairs.keys():
        return factorpairs[a]
    for i in range(2,round(math.sqrt(a))+1):
        if(a%i==0):
            factorpairs[a]=(i,a//i)
            return (i,a//i)
    return None

def seqLenOdd(num):
    if num in seqlens.keys():
        return seqlens[num]
    fs=factorpair(num)
    if fs is None:
        seqlens[num]=num+1
        return num+1
    seqlens[num]=num+seqLenOdd(fs[1])
    return seqlens[num]


def longestSequencePerChocolate(c):
    if c==1:
        return 1
    if c==2:
        return 3
    if c%2!=0:
        return seqLenOdd(c)    
    else:
        new_c=c//2
        if new_c%2!=0:
            return c+seqLenOdd(new_c)
        else:
            return c+longestSequencePerChocolate(new_c)

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    l=0
    for c in a:
        l+=longestSequencePerChocolate(c)
    return l
    
        

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