Longest Consonant Substring

Given a string s consisting solely of lowercase alphabetical characters, determine the length of the longest contiguous substring that contains only consonants. Recall that the vowels are defined as \(a, e, i, o, \) and \(u\). For example, given the input string "bcdfgh", the longest consonant substring is "bcdfgh" of length 6.

If the string does not contain any consonants, return 0. Note that an empty string should also return 0. This problem requires efficient processing of the input string in a single pass.

inputFormat

The input consists of a single line containing the string \(s\). The string \(s\) will only include lowercase alphabetical characters (\(a\) to \(z\)).

outputFormat

Output a single integer that represents the length of the longest continuous substring of consonants in \(s\).

bcdfgh

6