Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem B

The Color Game

Input: standard input

Output: standard output

In this problem, you will get introduced to a new game called the Color Game. In the N-cell  (3 <= N <= 100) color game, there are N cells each having a different color. For simplicity, we will assume that the colors are represented by unique positive integers ranging from 1 to N. Each cell has at most one edge (directed) of each color running to another or even the same cell. This is a two-player game and it consists of two phases. In the first phase one of the players plays and in the second phase plays the other.

Suppose player 1 plays in the first phase. At the beginning, player 2 selects three cells N₁, N₂ and N₃, and places two tokens in N₁ and N₂ respectively.  Now he challenges player 1 to move any one of the tokens to cell N₃ in as few moves as possible. In each move only one of the two tokens can be moved. A token can move from the current cell to an adjacent cell only following an edge of the same color as that of the cell the other token is in. At the end of the phase, player 2 must prove that there is a way of moving one of the tokens to cell N₃ otherwise he will lose. The second phase is similar to the first one except that the players are now reversed. The player solving the problem in fewer moves wins the game.

Now, given the description of the network of cells and the values of N₁, N₂ and N₃, you are asked to write a program to determine the minimum number of moves required to moves any of the tokens to cell N₃.

Input

The input file consists of several data blocks. Each data block describes a game.

The first line of a data block contains an integer N (3 <= N <= 100) representing the number of cells. Then follows N lines of N integers each. The j-th integer in the i-th line (1 <= i, j <= N) gives the cell number to which cell i is connected by an edge of color j. If cell i does not have an edge of color j, then this integer has a value 0. The last line of the data block contains the three integers: N₁, N₂ and N₃.

The input file terminates with a zero for N.

Output

For each game in the input first output the game number followed by the minimum number of moves required to solve it. Print the line "Destination is Not Reachable !" if the problem is not solvable. Print a blank line after the outputs for each data set.

Sample Input

Sample Output