#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const long long LLINF = 9223372036854775807LL;
string b, a;
int glas;
int sogl;
int sootn[200010];
vector<int> len[800100];
int main() {
  cin >> b;
  a = '0' + b;
  int maxdl = 0, count = 0;
  int t = -1;
  len[400001].push_back(0);
  for (int i = 1; i < a.length(); i++) {
    if (a[i] == 'a' || a[i] == 'e' || a[i] == 'i' || a[i] == 'o' ||
        a[i] == 'u' || a[i] == 'A' || a[i] == 'E' || a[i] == 'I' ||
        a[i] == 'O' || a[i] == 'U') {
      glas++;
    } else
      sogl++;
    sootn[i] = 2 * sogl - glas;
    len[sootn[i] + 400001].push_back(i);
  }
  for (int i = 0; i < 800001; i++) {
    if (len[i].size() > 1) {
      if (len[i].back() - len[i].front() > maxdl) {
        maxdl = len[i].back() - len[i].front();
        count = 0;
      }
      if (len[i].back() - len[i].front() == maxdl) count++;
    }
  }
  if (sootn[a.length() - 1] >= 0) {
    maxdl = a.length() - 1;
    count = 1;
  }
  if (maxdl == 0)
    cout << "No solution";
  else
    cout << maxdl << " " << count;
}
