For this Question: Given a string of length N, count the number of vowels present at even places.First line of input contains a single integer N. Second line contains a string of size N.

Constraints:-
1 <= N <= 100000

Note:- String will contain only lowercase english letterPrint the number of vowels present at the even placesSample Input:-
12
newtonschool

Sample Output:-
2

Sample Input:-
5
basid

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



class Main {
	public static void main (String[] args) throws IOException {

                 BufferedReader reader =new BufferedReader(new InputStreamReader(System.in));

      String name = reader.readLine();
      String s=reader.readLine();
                      long c=0;
                      for(int i=1;i<s.length();i=i+2){
      if(s.charAt(i)=='a'||s.charAt(i)=='e'||s.charAt(i)=='i'||s.charAt(i)=='o'||s.charAt(i)=='u')
                          c++;
                      }
                      System.out.println(c);
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?