For this Question: You have N coins with either an integer (between 0-9) written on one side and an english letter (a- z) written on the other side.

The following statement must be true for all coins:
<b>If the coin has a vowel on one side, then it must have an even integer on other side. </b>

For example coin having 'b' and '3' is valid (since 'b' is not a vowel, other side can be anything), coin having 'a' and '4' is valid, but coin having 'a' and '5' is invalid.

Now you're given just one side of each coin, find the minimum number of coins you need to flip to check the authenticity of the statement.The first and only line of input contains a string S, where each character in S depicts a side of the coin.


<b>Constraints:</b>
1 &le; |S| &le; 50Output a single integer, the minimum number of coins you need to flip.Sample Input
ee

Sample Output
2

Explanation: You need to flip both the coins to make sure an even integer is there on the other side of coin.

Sample Input
0ay1

Sample Output
2, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define pb push_back
#define ll long long
#define mp make_pair
#define F first
#define S second
 
int main(){
	string s;
	cin>>s;
	int ct=0;
	for(int i=0; i<s.length(); i++){
		if(s[i]=='a' || s[i]=='e' || s[i]=='i' || s[i]=='o' || s[i]=='u' || s[i]=='1' || s[i]=='3' || s[i]=='5' || s[i]=='7' || s[i]=='9'){
			ct++;
		}
	}
	cout<<ct;
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?