Unique Vowels Counter

Given a string s, count the number of unique vowels present in the string.

The vowels are given by the set $$\{a, e, i, o, u\}$$. The function should be case-insensitive and only consider alphabetic characters.

For example, if s is "hello", the output should be 2 (since only 'e' and 'o' are present), and if s is "aeiou", the output should be 5.

inputFormat

The input consists of a single line containing the string s.

Note: The string may contain spaces, numbers, and special characters.

outputFormat

Output a single integer representing the number of unique vowels present in the input string.## sample

bcdfg

0