#include <bits/stdc++.h>
using namespace std;
const char w[10] = {'a', 'e', 'i', 'o', 'u'};
int posl[200100];
int mas[200100];
char s[200100];
pair<int, int> r[800100];
int n;
int main() {
  cin >> s;
  n = strlen(s);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 5; j++)
      if (s[i] == w[j] || s[i] == w[j] + 'A' - 'a') {
        posl[i] = -1;
      }
    if (posl[i] == 0) posl[i] = 2;
  }
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      r[i].first = posl[i];
      r[i].second = i;
    } else {
      r[i].first = r[i - 1].first + posl[i];
      r[i].second = i;
    }
    mas[i] = r[i].first;
  }
  r[n].first = 0;
  r[n].second = -1;
  sort(r, r + n + 1);
  int otv = 0;
  int minz = r[0].second;
  for (int i = 1; i <= n; i++) {
    otv = max(r[i].second - minz, otv);
    minz = min(r[i].second, minz);
  }
  if (otv == 0) {
    cout << "No solution" << endl;
    return 0;
  }
  int o = 0;
  for (int i = 0; i < n; i++) {
    if (i + otv - 1 >= n) break;
    if (i == 0) {
      o += (mas[otv - 1] >= 0);
    } else {
      o += ((mas[i + otv - 1] - mas[i - 1]) >= 0);
    }
  }
  cout << otv << " " << o << endl;
}
