PROGRAMMING:Nearest distance

In a game, players are in a maze of 12 rows and 12 columns as follows:
0,1,0,0,0,1,1,1,0,1,0,1
0,0,0,1,0,0,0,0,1,0,0,1
0,1,0,1,0,1,1,1,0,1,0,0
0,1,0,0,0,0,0,1,0,0,1,1
0,0,0,0,1,0,0,0,0,0,0,0
0,0,1,0,0,0,1,0,0,0,1,0
0,0,1,0,0,0,0,0,1,0,0,0
1,0,0,1,0,1,0,0,0,1,0,1
0,0,1,0,1,0,1,0,1,0,0,0
0,0,0,0,0,1,0,0,0,1,1,0
0,0,0,0,0,1,0,0,0,0,0,0
0,1,0,1,0,0,0,1,0,1,0,0
The maze is composed of 0 and 1, 0 for road and 1 for obstacle.
Now, according to the position of the player and the virtual boss being attacked in the game, the player will be prompted with the closest distance.
Nearest distance: the minimum number of steps a player takes to get to the boss（ Note: a step in the route refers to walking from a coordinate point to its upper, lower, left and right adjacent coordinate points.)
###Input format:
Enter four integers a, B, C, D (that is, the coordinates of player and virtual boss in the maze are (a, b), (C, d)),
Where 0 < = a, B, C, d < 12.
###Output format:
Output the minimum number of steps from (a, b) to (C, d) in the maze. If (a, b) can never reach (C, d), output 10000.
###Input example:
Here is a set of inputs. For example:
```in
0 0 11 11
```
###Output example:
The corresponding output is given here. For example:
```out
twenty-two
```







answer：If there is no answer, please comment