1. How many dots will have to be covered moving from '1' to '2' if only four
directions (up, down, right or left) are allowed? No direct jumping is 
allowed and 'X' cannot be visited.Input and output are given in the format as follows:

Input:
4
1 . X X
X . X X
. . X X
X . . 2

Output:
5

2. Find if a knight as in chess (that moves 2 steps along x- or y-axis and 1 step 
perpendicular to the traversed direction, as in L-shape) can start from '1' and 
reach '2' in exactly n steps. The grid is 8x8. Input and output are given in the
format as follows:

Input:
2
. . . . . . . .
. . . . . . . .
. . . 2 . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
. 1 . . . . . .
. . . . . . . .

Output:
Yes
(Also output is 'No' if n=1 or n=3)