For this Question: There are N balloons numbered from 1 to N. Every balloon has an another integer value Arr[i] assigned to it where i varies from 1 to N, and i represents the number of balloon.

A balloon at an odd position (i = 1, 3, 5. ) is happy if Arr[i] is odd.
A balloon at an even position (i = 2, 4, 6. ) is happy if Arr[i] is even.

Find the number of happy balloons.The first line of the input contains a single integer N.
The second line of the input contains N singly spaced integers, Arr[1], Arr[2], Arr[3],. , Arr[N].

Constrains
1 <= N <= 200000
1 <= Arr[i] <= 1000000Output a single integer, the number of happy balloons.Sample Input
5 
1 3 4 6 7

Sample Output
3

Explanation
Happy balloons are balloons numbered 1, 4, 5.

Sample Input
5
1 2 3 4 5

Sample Output
5, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args)throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		br.readLine();
		String[] line = br.readLine().split(" ");
		int happyBalloons = 0;

		for(int i=1;i<=line.length;++i){
			int num = Integer.parseInt(line[i-1]);
			if(num%2 == i%2 ){
				happyBalloons++;
			}
		}
		System.out.println(happyBalloons);
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?