The Way Home
The donkey Ia is returning home after a keen game in guests in Vinni Puh. He decided to have a walk. During a walk he thought about his birthday all of the time, which was approached. That’s shy he did not notice as strayed. It is known that a donkey during a walk always moves by a same algorithm. At the beginning of the walk he always begins motion to north-east and passing here to one step (he moving here in a point (1,1)). Then he changes his direction and moves to southeast, farther to south-west, and to north-west etc. A donkey always does to N-steps more than he did before changed direction at every changes of direction.
When a donkey decided to return home he discovered that he is situated deeply at the forest. Ia wanted to get home as quick as possible because night approached. Please, help to know, whether will succeed today a donkey get home before will be sunset of the sun. It is known that a sun will sunset through T-hours, and speed of donkeys movement is V-step on an hour. It is known that a donkey began its motion with a point with coordinates (0, 0), and his house is located in a point (hx, hy), and you know that he changed the direction of his motion K-times.
Input There are four integers N, K, T, V in the first line (0 ≤ N, K, T, V ≤ 100). There are two integers hx, hy in the second line. They are coordinates of donkeys’ house (-10^5 ≤ hx, hy ≤ 10^5).
Output
You have to write "Good night Ia" (without quotation marks), if a donkey will have enough time to get home before sun will sunset and write "Poor Ia" in other case.