Game on Strings#7250
Recently, Etibar made a new game on strings. Then he taught this game to his smart students - Kamran and Khayyam. And now both of them play that game very well.
You are given strings. The players are playing the game on -st and -nd string. In each turn a player chooses the first character of -st or -nd string and throws it out. If that character matches the first character of -rd string then he also throws that character out. The player after whose turn the -rd string remains empty, that player wins the game. Kamran plays first and both play optimally. Output who wins the game. If no one wins, output "Etibar".
In the first line you are given first string S_1. The next line contains second string S_2. The third line contains third string S_3. It is known that 1 \le |S_1|, |S_2|, |S_3| \le 100. The strings contain only lowercase letters.
Output who wins the game. If no one wins, output "Etibar".
Example 1