B'The black king lives on a chess board with an infinite number of columns (files) and 8 rows (ranks). The columns are numbered with all integer numbers (including negative). The rows are numbered from 1 to 8 . Initially, the black king is located on the starting square (x_s, y_s) , and he needs to reach some target square (x_t, y_t) . Unfortunately, there are also white pieces on the board, and they threaten the black king. After negotiations, the white pieces agreed to let the black king pass to the target square on the following conditions: Help the black king find the minimum number of moves needed to reach the target square while not violating the conditions. The black king cannot leave the board at any time. The black king moves according to the movement rules below. Even though the white pieces never move, squares which they can reach in one move are considered to be under attack, so the black king cannot move into those squares. Below are the movement rules. Note that the pieces (except for the knight) cannot jump over other pieces. There are no pawns on the board. The first line contains two integers x_s and y_s ( 1 <= x_s <= 10^8 ; 1 <= y_s <= 8 ) -- the starting coordinates of the black king. The second line contains two integers x_t and y_t ( 1 <= x_t <= 10^8 ; 1 <= y_t <= 8 ) -- the coordinates of the target square for the black king. The third line contains one integer n ( 0 <= n <= 2000 ) -- the number of white pieces on the board. Then n lines follow, the i -th line contains one character t_i and two integers x_i and y_i ( 1 <= x_i <= 10^8 ; 1 <= y_i <= 8 ) -- the type and the coordinates of the i -th white piece. The types of pieces are represented by the following uppercase Latin letters: There can be any number of white pieces of any type listed above on the board, for example, 3 white kings or '...