+ Time limit: 1 second + Memory limit: 256 megabytes ---------- You have probably seen the game *Flappy Bird*. In this game, a bird moves from left to right. The obstacles in this game have blocked either the top or bottom parts of the screen, and the goal is for the bird to reach the end of the game without hitting the obstacles.  In the simplified version of this game, assume the entire game environment is a $2 \times n$ grid. Each cell in the grid can have one of the following three states: + The bird is located in that cell (exactly one cell contains the bird). + There is an obstacle in that cell. + That cell is empty. Initially, we know the bird is located in the top-left cell and intends to move to the bottom-right cell (it is guaranteed that these two cells never have obstacles). The bird can move in any step to **side-adjacent** cells (if there is no obstacle). The question is whether the bird can find a path to reach the destination or not. For a better understanding of the question, refer to the examples. # Input In the first line of the input, a positive integer $n$ is given, representing the number of columns in the grid. $$1 \leq n \leq 100$$ In the next two lines, each line contains $n$ characters, where the character in the $i$-th row and $j$-th column specifies the state of the corresponding cell in the grid. The character `X` denotes an obstacle, and the character `O` denotes an open cell. The cell in the first row and first column, and the cell in the second row and $n$-th column, are the bird's start and destination, respectively, and are always marked with `O`. # Output In the single output line, if a path exists, print the string `Hooraaay!:)`, and otherwise, print the string `Awww:((`. # Examples ## Sample Input 1 ``` 8 OOXOOOXX XOOOXOOO ``` ## Sample Output 1 ``` Hooraaay!:)) ```  ## Sample Input 2 ``` 5 OOOXO OXXOO ``` ## Sample Output 2 ``` Awww:(( ```