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 answer = 0;
        for(int i = 0; i < a.length; i++)
        {
            if(a[i] == 1)
                answer += 1;
            else if(a[i] % 2 != 0)
                answer += a[i] + 1;
            else
                answer += (a[i]*2)-2;
        }
        return answer;
    }

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