Problem: One day, the Grasshopper was jumping on the lawn and found a piece of paper with a string. Grasshopper became interested what is the minimum jump ability he should have in order to be able to reach the far end of the string, jumping only on vowels of the English alphabet. Jump ability is the maximum possible length of his jump. 

Formally, consider that at the begginning the Grasshopper is located directly in front of the leftmost character of the string. His goal is to reach the position right after the rightmost character of the string. In one jump the Grasshopper could jump to the right any distance from 1 to the value of his jump ability.

<image> The picture corresponds to the first example.

The following letters are vowels: 'A', 'E', 'I', 'O', 'U' and 'Y'.

Input

The first line contains non-empty string consisting of capital English letters. It is guaranteed that the length of the string does not exceed 100. 

Output

Print single integer a — the minimum jump ability of the Grasshopper (in the number of symbols) that is needed to overcome the given string, jumping only on vowels.

Examples

Input

ABABBBACFEYUKOTT


Output

4

Input

AAA


Output

1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void RST(T &A, char x = 0) {
  memset(A, x, sizeof(A));
}
template <class T>
inline void SRT(T &A) {
  sort(A.begin(), A.end());
}
template <class T, class C>
inline void SRT(T &A, C B) {
  sort(A.begin(), A.end(), B);
}
const int DX[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int DY[8] = {0, 0, -1, 1, 1, -1, -1, 1};
const int inf = 0x3f3f3f3f;
const long long linf = 1LL << 60;
const double eps = 1e-9;
const double oo = 1e70;
const double pi = acos(-1.0);
inline double dcmp(const double &x) { return (x > eps) - (x < -eps); }
inline double dcmp(const double &x, const double &y) { return dcmp(x - y); }
template <class T>
inline void RD(T &x) {
  char c = getchar();
  x = 0;
  int flg = 0;
  while (c < '0' || c > '9') flg |= c == '-', c = getchar();
  while (c >= '0' && c <= '9') x = (x << 1) + (x << 3) + c - '0', c = getchar();
  if (flg) x = -x;
}
template <class T1, class T2>
inline void RD(T1 &x, T2 &y) {
  RD(x);
  RD(y);
}
template <class T1, class T2, class T3>
inline void RD(T1 &x, T2 &y, T3 &z) {
  RD(x);
  RD(y);
  RD(z);
}
template <class T1, class T2, class T3, class T4>
inline void RD(T1 &x, T2 &y, T3 &z, T4 &w) {
  RD(x);
  RD(y);
  RD(z);
  RD(w);
}
inline long long RD() {
  long long x;
  RD(x);
  return x;
}
inline void OT(int x) { printf("%d\n", x); }
inline void OT(long long x) { printf("%I64d\n", x); }
inline void OT(int x, int y) { printf("%d %d\n", x, y); }
inline void OT(long long x, long long y) { printf("%I64d %I64d\n", x, y); }
inline void setIO(char *in, char *out) {
  if (in) freopen(in, "r", stdin);
  if (out) freopen(out, "w", stdout);
}
template <class T>
inline void upmax(T &ans, const T &x) {
  ans = max(ans, x);
}
template <class T>
inline void upmin(T &ans, const T &x) {
  ans = min(ans, x);
}
inline char getAlpha() {
  char c = getchar();
  while (c < 'A' || c > 'Z') c = getchar();
  return c;
}
inline char getalpha() {
  char c = getchar();
  while (c < 'a' || c > 'z') c = getchar();
  return c;
}
inline void _gets(char *s) { scanf("%[^\n]", s); }
const int maxn = 100000 + 5;
const int mod = 100000007;
struct Int {
  int v;
  Int() {}
  Int(int x) {
    v = x % mod;
    if (v < 0) v += mod;
  }
  Int(long long x) {
    v = x % mod;
    if (v < 0) v += mod;
  }
  inline Int operator+(const Int &b) const { return v + b.v; }
  inline Int operator-(const Int &b) const { return v - b.v; }
  inline Int operator-() const { return -v; }
  inline Int operator*(const Int &b) const { return (long long)v * b.v; }
  friend inline Int pw(Int a, int b) {
    Int ans = 1;
    for (; b; b >>= 1, a = a * a)
      if (b & 1) ans = ans * a;
    return ans;
  }
};
int N;
char second[maxn];
bool isVowels(char c) {
  return c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U' || c == 'Y';
}
int main() {
  gets(second + 1);
  N = strlen(second + 1);
  int ans = 0, lst = 0;
  for (int i = 1; i <= N; i++)
    if (isVowels(second[i])) {
      upmax(ans, i - lst);
      lst = i;
    }
  upmax(ans, N + 1 - lst);
  OT(ans);
  return 0;
}