#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
const double eps = (1e-10);
int isGreater(long double x, long double y) {
  if (abs(x - y) < eps) return 0;
  if (x > y) return 1;
  return -1;
}
const int MAX_N = 2e5 + 5;
int a[MAX_N], pre[MAX_N], suff[MAX_N], maxRight[MAX_N];
string VOWEL = "aeiou";
bool isVowel(char c) {
  c = tolower(c);
  return find(VOWEL.begin(), VOWEL.end(), c) != VOWEL.end();
}
int n;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  n = (int)((s).size());
  for (int i = 1; i <= (int)((s).size()); ++i) {
    char c = s[i - 1];
    if (!isVowel(c))
      a[i] = 2;
    else
      a[i] = -1;
  }
  pre[0] = 0;
  for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + a[i];
  suff[n] = pre[n];
  for (int i = n - 1; i >= 0; --i) suff[i] = max(suff[i + 1], pre[i]);
  int maxLen = 0;
  for (int i = 0, r = 0; i <= n; ++i) {
    while (r <= n && suff[r] >= pre[i]) ++r;
    maxRight[i] = r - 1;
    maxLen = max(maxLen, maxRight[i] - i);
  }
  if (maxLen == 0) {
    cout << "No solution\n";
    return 0;
  }
  int cnt = 0;
  for (int i = 0; i <= n; ++i) {
    if (maxRight[i] - i == maxLen) cnt++;
  }
  cout << maxLen << " " << cnt << '\n';
  return 0;
}
