Queen's Journey 3#5724

Queen's Journey 3

1 second
64 megabytes
Easy

A list of squares on a 8 \times 8 chessboard is given as a sequence of queen's coordinates in chess notation. Determine whether this list represents a queen's path covering all squares on the board.

A square should be considered visited even if it is not stated explicitly in the list, but is passed through as part of one of the queen's straight-line moves.

Input

A single line contains a sequence of moves of the queen across the chessboard in chess notation (see examples). The length of the string is always even and does not exceed characters. The correctness of the moves according to chess rules is guaranteed.

Output

Print Yes if the queen's path covers all squares of the board, and No otherwise. Print the message without quotes.

Examples

Example 1

Loading
Loading