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

public class Solution {

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

    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();
    }
}