#include <bits/stdc++.h>
using namespace std;
int i, n, p[200001], rez, nrrez, c, s[200001];
char sa[200001];
int binarysearch(int st, int dr, int val) {
  if (st == dr) return st;
  int mij = (st + dr + 1) / 2;
  if (s[mij] >= val) return binarysearch(mij, dr, val);
  return binarysearch(st, mij - 1, val);
}
int main() {
  cin >> sa;
  n = strlen(sa);
  int v = 1;
  for (i = 0; i < n; i++) {
    if (sa[i] == 'a' || sa[i] == 'e' || sa[i] == 'i' || sa[i] == 'o' ||
        sa[i] == 'u' || sa[i] == 'A' || sa[i] == 'E' || sa[i] == 'I' ||
        sa[i] == 'O' || sa[i] == 'U')
      p[i + 1] = p[i] - 1;
    else {
      p[i + 1] = p[i] + 2;
      v = 0;
    }
  }
  if (v == 1)
    cout << "No solution";
  else {
    s[n + 1] = -10000000;
    p[n + 1] = -10000000;
    for (i = n; i >= 1; i--) {
      if (s[i + 1] > p[i])
        s[i] = s[i + 1];
      else
        s[i] = p[i];
    }
    rez = -1;
    nrrez = 0;
    for (i = 1; i <= n; i++) {
      c = binarysearch(i, n, p[i - 1]);
      if (c - i + 1 > rez) {
        rez = c - i + 1;
        nrrez = 0;
      }
      if (c - i + 1 == rez) nrrez++;
    }
    cout << rez << " " << nrrez;
  }
  return 0;
}
