The Queen's Journey 4
Given a sequence of squares on an 8×8 chessboard, represented as consecutive coordinates of a queen in chess notation, determine if this sequence forms a unique path that covers all squares on the board.
A square is considered visited if it lies on any straight-line move of the queen, even if it is not explicitly listed in the sequence.
Input
The input consists of a single line containing the sequence of the queen's moves on the chessboard, expressed in chess notation (refer to examples). The length of this line is always even and does not exceed 254 characters. The moves are guaranteed to be valid according to chess rules.
Output
Output "Yes" if the sequence represents a unique path of the queen that covers all squares on the board. Otherwise, output "No". The output should be without quotes.