#!/bin/python3

import sys

def longestSequence(a):
    #  Return the length of the longest possible sequence of moves.
    l=0
    for i in a:
        if(i==1):
            l=l+i
        elif(i%2==0):
            l=l+(i+(i-2))
        elif(i%2!=0):
            l=l+(i+1)
    return(l)

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