Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

5
1 3 4 5 7

Sample Output 1

2

Two squares, Square 1 and 5, satisfy both of the conditions.

For Square 2 and 4, the assigned numbers are not odd.

For Square 3, the written integer is not odd.

Sample Input 2

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

Sample Output 2

3

Solution in Java (OpenJDK 11.0.6) (judge verdict: Accepted)

    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStreamReader;
    import java.io.PrintWriter;
    import java.util.*;
    
    public class Main {
    
        void solve() throws IOException {
            int N = ni();
            long ans = 0;
            for (int i = 0; i < N; i++) {
                int a = ni();
                if((i+1)%2==1 && a%2==1) ans++;
            }
            out.println(ans);
        }

        final int mod = 1000000007;
        int mul(int x, int y){
            return (int)((x * 1L * y) % mod);
        }
        int add(int x, int y) {
            x += y;
            return x >= mod ? (x - mod) : x;
        }
        int sub(int x, int y){
            x = add(x,mod-y);
            return x >= mod ? (x - mod) : x;
        }
        String ns() throws IOException {
            while (!tok.hasMoreTokens()) {
                tok = new StringTokenizer(in.readLine(), " ");
            }
            return tok.nextToken();
        }
    
        int ni() throws IOException {
            return Integer.parseInt(ns());
        }
    
        long nl() throws IOException {
            return Long.parseLong(ns());
        }
    
        double nd() throws IOException {
            return Double.parseDouble(ns());
        }
    
        String[] nsa(int n) throws IOException {
            String[] res = new String[n];
            for (int i = 0; i < n; i++) {
                res[i] = ns();
            }
            return res;
        }
    
        int[] nia(int n) throws IOException {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = ni();
            }
            return res;
        }
    
        long[] nla(int n) throws IOException {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nl();
            }
            return res;
        }
    
        static BufferedReader in;
        static PrintWriter out;
        static StringTokenizer tok;
    
        public static void main(String[] args) throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            tok = new StringTokenizer("");
            Main main = new Main();
            main.solve();
            out.close();
        }
    }