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 n) {
      long sum=0;
        for(int i=0;i<n;i++)
      {     long t=0;
          t=a[i];
       if(t%2==0){
          t*=2;
           t-=2;
           sum+=t;
       }
       else if(t==1){sum+=1;}
       else{sum+=t+1;}
            
      }
        return sum;
    }

    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,n);
        System.out.println(result);
        in.close();
    }
}