Problem B. Vowels Input file: vowels.in Output file: standard output Balloon Color: Brown Given a string that consists of lowercase English letters, find the minimum number of operations needed to move all the vowels to the beginning of the string (vowels arrangement does not matter). In one operation: you can swap any two adjacent letters. Vowels are letters: ("a", "o", "y", "e", "u", "i") and the rest are constants. Input The first line contains one integer N (1 N