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

public class Solution {

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

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