Author:  А. Лепёха  Time limit:  1 sec  
Input file:  Standard input  Memory limit:  512 Mb  
Output file:  Standard output 
Brothers Boba and Aboba decided to play a game they knew from childhood. In this game players have a row of n stones in front of them. Each stone is either small or big. During their turn a player takes the leftmost stone and does one of the following:
After that the turn goes to the other player. The player who breaks the last stone (or the last two stones) during their turn wins.
Write a program that determines which of the brothers wins, if Aboba goes first.
The first line of the input contains one integer n — number of stones in the row.
The second line has n symbols, separated by a whitespace. The symbol «l
» corresponds to a big stone, while «s
» means a small one.
Output must contain Aboba
, if Aboba wins,
and Boba
otherwise.
1 ≤ n ≤ 10^{5}
No.  Standard input  Standard output 

1 


2 

