Giraffe Boris and centaur Eugene are playing with a string in the following game. Of course, they take turns making moves. Since Boris is a little older than Eugene, he goes first. If a player can use all the characters of the string to form a palindrome, that player wins; otherwise, the player removes any character of their choice from the string.
Who will win if both players use the optimal strategy?
The only line of input contains a string consisting of lowercase English letters, with length not exceeding 10^3.
If Boris wins, print Boris. If Eugene wins, print Eugene.
Example 1