Little monk loves good string. Good String is a string that only contains vowels $$(a, e, i, o, u)$$. Now, his teacher gave him a string $$S$$. Little monk is wondering what is the length of the longest good string which is a substring of $$S$$.
Note: Strings contains only lower case English Alphabets.
First line contains a string $$S$$, $$(1 \le |S| \le 10^5)$$, where $$|S|$$ denotes the length of the string.
Print an integer denoting the length of the longest good substring, that is substring consists of only vowels.
Longest Good String which is a substring of $$S$$ is $$aa$$ so the answer is $$2$$.