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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

public class Main {

	private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	private static boolean ans = false;
	private static List<Move> finalMoves = new ArrayList<Move>();

	private static class Move {
		public int index;
		public char loc;

		public Move(int index, char loc) {
			this.index = index;
			this.loc = loc;
		}
	}

	public static void main(String[] args) throws IOException {
		int i, j, t;
		int n;
		String str = br.readLine();
		n = str.length();
		int ans = 0;
		int p = 0;
		i = 0;
		// StringBuilder builder = new StringBuilder("B");
		// builder.append(str).append("B");
		// str = builder.toString();
		boolean found = false;
		while (i < n) {
			if (str.charAt(i) == 'A' || str.charAt(i) == 'E' || str.charAt(i) == 'I' || str.charAt(i) == 'O'
					|| str.charAt(i) == 'U' || str.charAt(i) == 'Y') {
				if (i == 0) {
					ans = 1;
				} else {
					if (i - p > ans) {
						ans = i - p;
						if (!found) {
							ans++;
						}
					}
				}
				p = i;
				found = true;
			}
			i++;
		}
		if (ans == 0) {
			ans = n + 1;
		}
		if (i - p > ans) {
			ans = i - p;
		}
		System.out.println(ans);
	}

	private static void perform(List<Integer> a, int n, List<Integer> b, int m, List<Move> moves) {
		if (ans) {
			return;
		}
		ans = isEquals(a, n, b, m);
		if (ans) {
			finalMoves = moves;
			return;
		}
		if (n <= m) {
			return;
		}

		List<Move> newMoves = new ArrayList<Move>();
		newMoves.addAll(moves);
		for (int i = 0; i < n; i++) {
			if (i < n - 1 && a.get(i) < a.get(i + 1)) {
				// left
				newMoves.add(new Move(i + 2, 'L'));
				List<Integer> newA = new ArrayList<Integer>();
				for (int j = 0; j < n; j++) {
					if (j == i) {
						newA.add(a.get(i) + a.get(i + 1));
						j++;
					} else {
						newA.add(a.get(j));
					}
				}
				perform(newA, n - 1, b, m, newMoves);
			}
			if (i < n - 1 && a.get(i) > a.get(i + 1)) {
				// right
				newMoves = new ArrayList<Move>();
				newMoves.addAll(moves);
				newMoves.add(new Move(i + 1, 'R'));
				List<Integer> newA = new ArrayList<Integer>();
				for (int j = 0; j < n; j++) {
					if (j == i) {
						newA.add(a.get(i) + a.get(i + 1));
						j++;
					} else {
						newA.add(a.get(j));
					}
				}
				perform(newA, n - 1, b, m, newMoves);
			}
		}
	}

	private static boolean isEquals(List<Integer> a, int n, List<Integer> b, int m) {
		if (m != n) {
			return false;
		}
		for (int i = 0; i < n; i++) {
			if (a.get(i) != b.get(i)) {
				return false;
			}
		}
		return true;
	}

	public static int readInt() throws NumberFormatException, IOException {
		return Integer.parseInt(br.readLine());
	}

	public static long readLong() throws NumberFormatException, IOException {
		return Long.parseLong(br.readLine());
	}

	public static Integer[] readArray() throws IOException {
		String[] arr = br.readLine().split(" ");
		Integer[] a = new Integer[arr.length];
		for (int i = 0; i < arr.length; i++) {
			a[i] = Integer.parseInt(arr[i]);
		}
		return a;
	}

	public static long[] readLongArray() throws IOException {
		String[] arr = br.readLine().split(" ");
		long[] a = new long[arr.length];
		for (int i = 0; i < arr.length; i++) {
			a[i] = Long.parseLong(arr[i]);
		}
		return a;
	}
}