Explosive Chapaeff
Let's fight until about six o'clock, and then we'll have dinner. L. Carroll
Guard duty at the ammunition depot of the N-th military garrison can be quite dull. To pass the time, soldiers Afanasiy and Eryoma devised a game: on a rectangular field with m rows and n columns, they placed several TNT blocks, ensuring no more than one block per cell. The columns run parallel to the North-South direction, while the rows run West-East. The soldiers take turns making moves. During a move, a soldier can pick up a TNT block and throw it any distance strictly to the North. If it lands in an "occupied" cell, both it and the block already there explode. If it lands in an "empty" cell, it stays intact. The soldier who has no choice but to throw a block off the field loses, as the ammunition depot of the N-th military garrison is located north of the field. If all blocks are used up, the game ends in a draw. Your task is to determine the outcome of this game, given that Afanasiy and Eryoma both know the winning strategy.
Input
The first line contains 2 numbers: m and n (1 ≤ m, n ≤ 1000). Following this, there are m rows, each containing n characters: 'O' (Latin letter O) indicates a TNT block is present in that cell, and '_' indicates the cell is empty. Afanasiy makes the first move. Note that north is at the top of the map.
Output
Print "Afanasiy has blown it up" if Afanasiy loses, "Eryoma has blown it up" if Eryoma loses, and "It's so boring..." if the game ends in a draw.