Lonely king
The lonely king wandered through the infinite chessboard. It is known the sequence of its n moves (up, down, left, right, up-left, etc.) the possible moves of the king are shown below.
Create an algorithm that determines whether the king has visited twice the same field in his n moves.
Input
First line contains the number of king's moves n (0 ≤ n ≤ 1000). Next n lines give the directions of king's moves: line number i + 1 gives the king's direction at the i-th move.
Output
Print a single number - the number of the move when the King first come to some cell for the second time. If such event will not happen, print "Ok" message in the first line (without quotes), and in the second line print the Manhattan distance between the starting and ending points of king's travel path.
Manhattan distance is a distance between the points with coordinates (x[1], y[1]) and (x[2], y[2]) that evaluates by the formula: d = |x[2] - x[1]| + |y[2] - y[1]|.