#include <bits/stdc++.h>
using namespace std;
using namespace rel_ops;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int inf = 1010101010;
const double PI = 4 * atan(1);
bool is_vowel[256] = {};
int main() {
  is_vowel['a'] = true;
  is_vowel['A'] = true;
  is_vowel['e'] = true;
  is_vowel['E'] = true;
  is_vowel['i'] = true;
  is_vowel['I'] = true;
  is_vowel['o'] = true;
  is_vowel['O'] = true;
  is_vowel['u'] = true;
  is_vowel['U'] = true;
  string s;
  cin >> s;
  int n = ((int)(s).size());
  vector<int> f(n + 1);
  for (int i = 0; i < (n); i++) f[i + 1] = f[i] + is_vowel[s[i]];
  int mx = 0, cnt = 0;
  vector<int> cands;
  cands.push_back(n);
  for (int i = n - 1; i >= 0; i--) {
    if ((3 * f[cands[((int)(cands).size()) - 1]] -
         2 * (cands[((int)(cands).size()) - 1])) > (3 * f[i] - 2 * (i))) {
      cands.push_back(i);
    } else {
      int lo = 0, hi = ((int)(cands).size()) - 1;
      while (lo - hi) {
        int mi = (lo + hi) / 2;
        if ((3 * f[cands[mi]] - 2 * (cands[mi])) <= (3 * f[i] - 2 * (i))) {
          hi = mi;
        } else
          lo = mi + 1;
      }
      int j = cands[lo];
      if (j - i == mx) {
        cnt++;
      } else if (j - i > mx) {
        mx = j - i;
        cnt = 1;
      }
    }
  }
  if (mx) {
    cout << mx << " " << cnt << endl;
  } else {
    puts("No solution");
  }
}
