#!/bin/python3

import sys

def longestSequence(a):
    ctr=1; y=0
    for i in a:
        x=i
        
        if ctr!=x:
            for j in range (2,x//2+1):
                if (x//j)%2==0:
                    ctr+=j
                else:
                    ctr+=x
                    
    return(ctr)

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