Chess is a two-player strategy board game played on a chessboard, a square checkered game board with 64 squares arranged in an eight-by-eight grid. It is one of the world's most popular games, played by millions of people worldwide at home, in clubs, online, by correspondence, and in tournaments. Each player begins the game with 16 pieces: one king, one queen, two rooks, two knights, two bishops, and eight pawns. Each of the six piece types moves differently. Pieces are used to attack and capture the opponent's pieces, with the objective to 'checkmate' the opponent's king by placing it under an inescapable threat of capture. In addition to checkmate, the game can be won by the voluntary resignation of the opponent, which typically occurs when too much material is lost, or if checkmate appears unavoidable. A game may also result in a draw in several ways, where neither player wins. The course of the game is divided into three phases: opening, middle game, and endgame. Source Wikipedia

To simplify this problem you will only deal with kings, knights and pawns of the black and the white players. Assume that the white player starts at the lower half of the board and the black player starts at the upper half. Given the state of the board, your task is to determine whether the black king is checked or not. For clarity a 'Check' occurs when the King's square can be attacked by any of the opponent's pieces for his next move, and note that in this problem we will ignore the consequences which will follow, we don’t even care whose turn is now but only consider the board state (out of chess rules).

The knight moves like an "L", it moves from cell (r1, c1) to cell (r2, c2) if and only if (r1 - r2)² + (c1-c2)² = 5 (8 possible moves).

The king can move only one move in its four main directions and its four diagonals (8 possible moves).

The pawn attacks only one move diagonally and only to the opponent direction (2 possible moves).

This problem is NOT following all chess rules, for example in real chess third case in the sample is INVALID, so please assume that the given board is always valid, just check the black king state.

Input

You are given an 8x8 board with chess pieces denoted as following: BK = black king, WK = white king, BH = black knight, WH = white knight, BP = black pawn, WP = white pawn. We ensure that there is one and only one black king in the chess board. Blank fields are denoted by “-”. Cases are separated by blank lines.

Output

You should output “Check” if a check exists or “Not Check” if no check exists. Follow the output format described in the sample tests.

Example

Input:
3
- - - - - - - -
- - - - - - - -
- - - - - - - -
- BH - - - - - -
- - - BK - - - -
- - WP - - - - -
- - - - - - - -
- - - - - - - -

- - - - - - - -
BH - - BH - - - -
- - - - - - - -
- - - - - - - -
- - - BK - - - -
- - - - - - - -
- WP - - - - WH -
- - - WK - - - -

- - - - - - - -
- - - - - - - -
- - - - - - - -
- - - - - - - -
- - - BK - - - -
- - - WK - - - -
- - - - - - WH -
- - - - - - - -

Output:
Case #1: Check
Case #2: Not Check
Case #3: Check