Monke likes chess a lot. He has an infinite chess board and his favourite chess piece is a Knight. A knight can move two squares vertically and one square horizontally or two squares horizontally and one square vertically.
Formally, a Knight can move from $$$(x_i, y_i)$$$ to $$$(x_j, y_j)$$$ only if $$$((|x_i - x_j| = 1) \land (|y_i - y_j| = 2)) \lor ((|x_i - x_j| = 2) \land (|y_i - y_j| = 1))$$$
He's playing a game with his friend Potato. Initially Monke placed a knight on square $$$(x_1, y_1)$$$. Then Potato picks another square $$$(x_2, y_2)$$$. If Monke can move to the square selected by Potato in ODD number of moves, he wins. Otherwise, she wins. Now your task is to determine the winner of the game.
The first line of input contains an integer $$$t$$$ $$$(1 \leq t \leq 10^5$$$), the number of test cases.
Each test case contains $$$4$$$ integers $$$x1, y1, x2, y2$$$. ($$$1 \leq x1, y1, x2, y2 \leq 10 ^ 6$$$).
For each test case, print Monke if the winner is Monke, print Potato otherwise.
31 1 4 5100 2 9 111 1 1 2
Monke Potato Monke
