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: #include<bits/stdc++.h>
using namespace std;
bool check(char c){
    if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){return true;}
    else{
        return false;
    }
}

int main() {
int n;   cin>>n;
    string s;
    cin>>s;
    int j=0;
    int cnt=0;
    int ans=0;
    for(int i=0;i<n;i++){
            if(i&1){
        if(s[i]=='a' || s[i]=='e' || s[i]=='i' || s[i]=='o' || s[i]=='u'){
        cnt++;
        }}
    }
       cout<<cnt;

}

, In this Programming Language: C++, Now tell me if this Code is compilable or not?