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 JAVA):

Solution:
import java.io.*;
import java.math.*;
import java.util.*;

public class CodeJam_1 {
	public static void main(String args[]) {
		FasterScanner s = new FasterScanner();
		PrintWriter out = new PrintWriter(System.out);
		char s1[]=s.nextLine().toCharArray();
		boolean b=true;
		int c=0;
		int max=1;
		int a[]=new int[s1.length+1];
		a[s1.length]=s1.length;
		if(s1[0]=='A' ||s1[0]=='E' ||s1[0]=='I' ||s1[0]=='O' ||s1[0]=='U'||s1[0]=='Y' ){
			a[0]=0;
		}
		else
			a[0]=-1;
		for(int i=1;i<s1.length;i++){
			if(s1[i]=='A' ||s1[i]=='E' ||s1[i]=='I' ||s1[i]=='O' ||s1[i]=='U'||s1[i]=='Y'  ){
				a[i]=i;
			}
			else{
				a[i]=a[i-1];
			}
		}
		for(int i=1;i<=s1.length;i++){
			max=Math.max(max,a[i]-a[i-1]);
		}
		System.out.println(Math.max(c,max));
		out.close();
	}

	class ZFunction {

		// z[i] = lcp(s[0..], s[i..])
		public  int[] zFunction(String s) {
			int[] z = new int[s.length()];
			for (int i = 1, l = 0, r = 0; i < z.length; ++i) {
				if (i <= r)
					z[i] = Math.min(r - i + 1, z[i - l]);
				while (i + z[i] < z.length && s.charAt(z[i]) == s.charAt(i + z[i]))
					++z[i];
				if (r < i + z[i] - 1) {
					l = i;
					r = i + z[i] - 1;
				}
			}
			return z;
		}

		// random tests
		public  void main(String[] args) {
			Random rnd = new Random(1);
			for (int step = 0; step < 10_000; step++) {
				String s = getRandomString(rnd, 100);
				String pattern = getRandomString(rnd, 5);
				int pos1 = find(s, pattern);
				int pos2 = s.indexOf(pattern);
				if (pos1 != pos2)
					throw new RuntimeException();
			}
		}

		 int find(String s, String pattern) {
			int[] z = zFunction(pattern + "\0" + s);
			for (int i = pattern.length() + 1; i < z.length; i++)
				if (z[i] == pattern.length())
					return i - pattern.length() - 1;
			return -1;
		}

		 String getRandomString(Random rnd, int maxlen) {
			int n = rnd.nextInt(maxlen) + 1;
			char[] s = new char[n];
			for (int i = 0; i < n; i++)
				s[i] = (char) ('a' + rnd.nextInt(3));
			return new String(s);
		}
	}

	
	static void power1(long F[][], long n, long m) {
		if (n == 0 || n == 1)
			return;
		long M[][] = { { 1, 1 }, { 1, 0 } };

		power1(F, n >> 1, m);
		multiply(F, F, m);

		if ((n & 1) != 0)
			multiply(F, M, m);
	}


	static class FasterScanner {
		private byte[] buf = new byte[1024];
		private int curChar;
		private int snumChars;

		public int read() {
			if (snumChars == -1)
				throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = System.in.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		public String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}

		public String nextString() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		public long nextLong() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public int nextInt() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

		public int[] nextIntArray(int n) {
			int[] arr = new int[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextInt();
			}
			return arr;
		}

		public long[] nextLongArray(int n) {
			long[] arr = new long[n];
			for (int i = 0; i < n; i++) {
				arr[i] = nextLong();
			}
			return arr;
		}

		private boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
	}
	static void multiply(long F[][], long M[][], long m) {
		long x = ((F[0][0] * M[0][0]) + (F[0][1] * M[1][0]));
		long y = ((F[0][0] * M[0][1]) + (F[0][1] * M[1][1]));
		long z = ((F[1][0] * M[0][0]) + (F[1][1] * M[1][0]));
		long w = ((F[1][0] * M[0][1]) + (F[1][1] * M[1][1]));
		x %= m;
		y %= m;
		z %= m;
		w %= m;
		F[0][0] = x;
		F[0][1] = y;
		F[1][0] = z;
		F[1][1] = w;
	}
}