import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        int l=a.length;
        long count=0;
        for(int i =0; i<l;i++)
        {
            if(a[i]==1)
                count=count+1;
            else if(a[i]%2!=0)
                count=count+a[i]+1;
            else
            {
                count=count+a[i]+a[i]-2;
            }
        }
        return count;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}