We have N squares assigned the numbers 1,2,3,\ldots,N. Each square has an integer written on it, and the integer written on Square i is a_i.

How many squares i satisfy both of the following conditions?

* The assigned number, i, is odd.
* The written integer is odd.

Constraints

* All values in input are integers.
* 1 \leq N, a_i \leq 100

Input

Input is given from Standard Input in the following format:


N
a_1 a_2 \cdots a_N


Output

Print the number of squares that satisfy both of the conditions.

Examples

Input

5
1 3 4 5 7


Output

2


Input

15
13 76 46 15 50 98 93 77 31 43 84 90 6 24 14


Output

3
import java.util.Scanner;

public class Main {
	
	private static Scanner sc;
	
	public static void main (String args[]) {
		sc = new Scanner(System.in);
		//マスの数(1～100の範囲)
		int n = Integer.parseInt(sc.next());
		int result = 0;
		//マスに入っている値
		for(int i = 0; i < n; i++) {
			int der1 = i%2;
			int a = Integer.parseInt(sc.next());
			int der2 = a%2;
			if (der1==0 && der2==1) {
				result++;
			}
		}
		System.out.println(result);
	}	
}
