Problem K. Rock by rock ≡

Statement

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:

1. Smashes the stone to the ground and breaks it.
2. Hits the closest stone to the right. There are two possible outcomes:
   • If both stones have the same size they both break.
   • If one of them is big and the other is small, then the big one cracks and turns small, and the small one breaks. Therefore, two stones turn into one small stone.

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.

Input format

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 format

Output must contain Aboba, if Aboba wins, and Boba otherwise.

Constraints

1 ≤ n ≤ 10⁵

Sample tests

4
l s l s

Boba

2
l s

Boba