Longest Substring Without Vowels

Given a string s consisting only of lowercase English letters, your task is to find the length of the longest contiguous substring that does not contain any vowels.

Vowels are defined as $\{a, e, i, o, u\}$. For example, in the string "abcdeiouxyz", the longest substring without vowels is "xyz" with a length of 3.

Please read the input from stdin and write the result to stdout.

inputFormat

The input consists of a single line containing the string s (which may be empty). The string includes only lowercase English letters.

outputFormat

Output a single integer representing the length of the longest substring of s that does not contain any vowels ($\{a, e, i, o, u\}$).

aeiou

0