#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




string a;

int consistency1(int n){
	vector<char> order = {'a','e','i','o','u'};
	
	
	vector<vector<int>> dp(n+1, vector<int>(5, 0)); // to maximize , set to null == 0 (in case of length)
	for(int i=0; i<5; i++) dp[0][i] = 0;
	
	for(int i=1; i<=n; i++){
		
		//* for 'a' case 
		if(a[i-1] == 'a'){
			dp[i][0] = dp[i-1][0]+1;
		}
		else{
			dp[i][0] = dp[i-1][0];
		}
		
		//* for 'e' , 'i' , 'o', 'u' cases 
		for(int k=1; k<5; k++){
			
			int ct = 0;
			if(a[i-1] == order[k]) ct = 1;
			
			int j = i-1;
			while(j >= 0){
			    if (dp[j][k-1] > 0) dp[i][k] = max(dp[i][k], dp[j][k-1] + ct);
			    if (dp[j][k] > 0)   dp[i][k] = max(dp[i][k], dp[j][k] + ct);
			    
			    if (ct == 0) {
			        dp[i][k] = max(dp[i][k], dp[j][k-1]);
			        dp[i][k] = max(dp[i][k], dp[j][k]);
			    }
			    j--;
			}
		}
	}
	
	return dp[n][4];

}






int consistency2(int n){

	vector<vector<int>> dp(n+1, vector<int>(5, 0)); // to maximize , set to null == 0 (in case of length)
	for(int i=0; i<5; i++) dp[0][i] = 0;
	
	vector<char> order = {'a','e','i','o','u'};
	
	for(int i=1; i<=n; i++){
		
		//* for 'a' case 
		if(a[i-1] == 'a')	dp[i][0] = dp[i-1][0]+1;
		else	dp[i][0] = dp[i-1][0];
		
		//* for 'e', 'i', 'o', 'u' case 
		for(int k=1; k<5; k++){
			if (a[i-1] == order[k]) {
			    if (dp[i-1][k-1] > 0 || dp[i-1][k] > 0) {
			        dp[i][k] = max(dp[i-1][k-1], dp[i-1][k]) + 1;
			    }
			} else {
			    dp[i][k] = dp[i-1][k];
			}
		}
	}
	
	return dp[n][4];

}


















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    
	cin >> a;
	n = a.size();
    
    cout << consistency1(n) << " " << consistency2(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}