8. 最长的指定瑕疵度的元音子串

const readline = require('readline');
const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout,
});

rl.on('line', (input) => {
    let flaw = parseInt(input);
    rl.on('line', (input) => {
        let aeiou = ['a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'];
        let indexArr = [];
        for(let i=0; i<input.length; i++) {
            if (aeiou.includes(input[i])) {
                indexArr.push(i);
            }
        }
        let left = 0;
        let right = 0;
        let ans = [];
        while(right < indexArr.length) {
            let curFlaw = indexArr[right] - indexArr[left] - (right - left);
            if (curFlaw > flaw) {
                left++;
            } else {
                if (curFlaw === flaw) {
                    ans.push(indexArr[right] - indexArr[left] + 1);
                }
                right++;
            }
        }
        console.log(Math.max(ans));
    });
});