#include <bits/stdc++.h>
using namespace std;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
const int M = 100005 * 8;
int sum[M], prop[M];
void propagate(int l, int r, int k) {
  if (l != r) {
    prop[k * 2] += prop[k];
    prop[k * 2 + 1] += prop[k];
  }
  sum[k] += prop[k];
  prop[k] = 0;
}
void update(int l, int r, int k, int L, int R, long long val) {
  propagate(l, r, k);
  if (l > R || r < L) return;
  if (l >= L && r <= R) {
    prop[k] = val;
    propagate(l, r, k);
    return;
  }
  int mid = (l + r) / 2;
  update(l, mid, k * 2, L, R, val);
  update(mid + 1, r, k * 2 + 1, L, R, val);
  sum[k] = max(sum[k * 2], sum[k * 2 + 1]);
}
long long query(int l, int r, int k) {
  propagate(l, r, k);
  if (l == r) {
    if (sum[k] >= 0) return l;
    return -1;
  }
  int mid = (l + r) / 2;
  propagate(l, mid, k * 2);
  propagate(mid + 1, r, k * 2 + 1);
  if (sum[k * 2 + 1] >= 0)
    return query(mid + 1, r, k * 2 + 1);
  else
    return query(l, mid, k * 2);
}
string s;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int vis[300] = {0};
  vis['A'] = vis['E'] = vis['I'] = vis['O'] = vis['U'] = 1;
  vis['a'] = vis['e'] = vis['i'] = vis['o'] = vis['u'] = 1;
  int n;
  cin >> s;
  n = s.size();
  long long res = -1, cnt = 0;
  for (int i = 1; i <= n; i++) {
    char ch = s[i - 1];
    if (vis[ch])
      update(1, n, 1, i, n, -1);
    else
      update(1, n, 1, i, n, 2);
  }
  for (int i = 1; i <= n; i++) {
    char ch = s[i - 1];
    int ret = query(1, n, 1) - i + 1;
    if (ret > res) {
      res = ret;
      cnt = 1;
    } else if (ret == res) {
      cnt++;
    }
    if (vis[ch])
      update(1, n, 1, i, n, 1);
    else
      update(1, n, 1, i, n, -2);
    update(1, n, 1, i, i, -n);
  }
  if (res == -1)
    cout << "No solution" << endl;
  else
    cout << res << " " << cnt << endl;
  return 0;
}
