eolymp
bolt
Try our new interface for solving problems
Problems

Game on Strings

Game on Strings

Time limit 0.5 seconds
Memory limit 64 MiB

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 3 strings. The players are playing the game on 1^st and 2^nd string. In each turn a player choose the first character of 1^st or 2^nd string and throw it out. If that character is match with the first character of 3^rd string then he also throw that character out. After whose turn the 3^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.

Input data

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 ≤ |S_1|, |S_2|, |S_3| ≤ 100. The strings contain only lowercase letters.

Output data

Output who win the game. If no one wins, output Etibar.

Examples

Input example #1
ab
bc
ab
Output example #1
Khayyam
Author Mahammad Valiyev
Source Local Contest #2 Qafqaz University by Mahammad Valiyev