#!/bin/python3 import sys import math def is_prime(n): if n == 2: return True if n % 2 == 0 or n <= 1: return False sqr = int(math.sqrt(n)) + 1 for divisor in range(3, sqr, 2): if n % divisor == 0: return False return True def count(item): global sum_item if item ==1 : sum_item +=1 return elif item == 3: sum_item +=4 return elif item %2 !=0 : if is_prime(item): sum_item+= item +1 return else: for divisor in range(3,item,2): if item %divisor ==0: sum_item += item count(int(item/divisor)) break elif item %2 ==0 : sum_item += item count(int(item/2)) def longestSequence(a): # Return the length of the longest possible sequence of moves. global sum_item for item in a: count(item) return int(sum_item) if __name__ == "__main__": sum_item =0 n = int(input().strip()) a = list(map(int, input().strip().split(' '))) result = longestSequence(a) print(result)