#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200010;
int a[MAXN], n, sum[MAXN];
char s[MAXN];
int check(char c) {
  if (c == 'a' || c == 'A') return -1;
  if (c == 'e' || c == 'E') return -1;
  if (c == 'i' || c == 'I') return -1;
  if (c == 'o' || c == 'O') return -1;
  if (c == 'u' || c == 'U') return -1;
  return 2;
}
int q[MAXN];
int pos[MAXN];
int main() {
  scanf("%s", s);
  n = strlen(s);
  for (int i = 1; i <= n; i++) a[i] = check(s[i - 1]);
  sum[0] = 0;
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  int cnt = 0, len = 0;
  for (int i = n; i >= 0; i--) {
    if (cnt == 0 || sum[i] > q[cnt]) {
      q[++cnt] = sum[i];
      pos[cnt] = i;
    }
    int l = 1, r = cnt, ret;
    while (l <= r) {
      int mid = (l + r) >> 1;
      if (q[mid] >= sum[i]) {
        ret = mid;
        r = mid - 1;
      } else
        l = mid + 1;
    }
    len = max(len, pos[ret] - i);
  }
  int res = 0;
  for (int i = 1; i <= n - len + 1; i++)
    if (sum[i + len - 1] - sum[i - 1] >= 0) res++;
  if (len != 0)
    printf("%d %d\n", len, res);
  else
    printf("No solution\n");
  return 0;
}
