#C11384. Taco Vowel Game

    ID: 40694 Type: Default 1000ms 256MiB

Taco Vowel Game

Taco Vowel Game

You are given a string s consisting of English letters. Two players take turns removing one vowel (i.e., one of a, e, i, o, u) from the string. The player who removes the last vowel wins the game. It can be shown that the winner is completely determined by the parity of the total number of vowels in the string. Specifically, if the total number of vowels is odd, the first player wins; otherwise, the second player wins.

Your task is to write a program that, given the string s from standard input, determines which player wins the game. Note that the string may include uppercase letters, but only lowercase vowels (a, e, i, o, u) are counted.

inputFormat

The input consists of a single line containing the string s (which may include both lowercase and uppercase letters). You should read this from standard input.

outputFormat

Output a single line containing Player 1 if the first player wins (i.e. when the number of vowels is odd), or Player 2 otherwise. Write the output to standard output.

## sample
a
Player 1