Giraffe Boris and centaur Eugene are playing with the string in the following game. Of course, they are doing moves one by one. Since Boris was a little older than Eugene, he started first. If a player can form from the string, using all it’s characters, palindrome, he wins, otherwise, he removes any character he liked from the string. Who will win if both use the optimal strategy? \InputFile The only line of input contains string, consisting of lowercase English letters, it’s length doesn’t exceed \textbf{10^3}. \OutputFile If Boris wins - print \textbf{Boris}. If you Eugene wins - print \textbf{Eugene}.