CF #220 Inna and Pink Pony

A. Inna and Pink Pony

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Dima and Inna are doing so great! At the moment, Inna is sitting on the magic lawn playing with a pink pony. Dima wanted to play too. He brought an n × m chessboard, a very tasty candy and two numbers a and b.

Dima put the chessboard in front of Inna and placed the candy in position (i, j) on the board. The boy said he would give the candy if it reaches one of the corner cells of the board. He's got one more condition. There can only be actions of the following types:

• move the candy from position (x, y) on the board to position (x - a, y - b);
• move the candy from position (x, y) on the board to position (x + a, y - b);
• move the candy from position (x, y) on the board to position (x - a, y + b);
• move the candy from position (x, y) on the board to position (x + a, y + b).

Naturally, Dima doesn't allow to move the candy beyond the chessboard borders.

Inna and the pony started shifting the candy around the board. They wonder what is the minimum number of allowed actions that they need to perform to move the candy from the initial position (i, j) to one of the chessboard corners. Help them cope with the task!

Input

The first line of the input contains six integers n, m, i, j, a, b (1 ≤ n, m ≤ 106; 1 ≤ i ≤ n; 1 ≤ j ≤ m; 1 ≤ a, b ≤ 106).

You can assume that the chessboard rows are numbered from 1 to n from top to bottom and the columns are numbered from 1 to m from left to right. Position (i, j) in the statement is a chessboard cell on the intersection of the i-th row and the j-th column. You can consider that the corners are: (1, m), (n, 1), (n, m), (1, 1).

Output

In a single line print a single integer — the minimum number of moves needed to get the candy.

If Inna and the pony cannot get the candy playing by Dima's rules, print on a single line "Poor Inna and pony!" without the quotes.

Sample test(s)

input

5 7 1 3 2 2

output

2

input

5 5 2 3 1 1

output

Poor Inna and pony!

Note

Note to sample 1:

Inna and the pony can move the candy to position (1 + 2, 3 + 2) = (3, 5), from there they can move it to positions (3 - 2, 5 + 2) = (1, 7) and (3 + 2, 5 + 2) = (5, 7). These positions correspond to the corner squares of the chess board. Thus, the answer to the test sample equals two.

题目链接：http://codeforces.com/contest/374/problem/A

题意：给你一个棋盘n*m，然后放一个糖在棋盘上i,j，每次行，列变化为a,b。问最小的步数到达四个角落。

刚开始本来用BFS，发现棋盘太大了！！！后来想了一想发现可以直接判断能否到达4个角落，可惜晚上断网，写出了四个if，久久不能AC,无奈睡觉。后来第二天在群消息发现了问题，有可能一步就走出棋盘，不能走了。好吧。改了之后，果断A了。。。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <queue>
#include <map>
#include <stack>
#include <list>
#include <vector>
using namespace std;
//#define DEBUG
int main()
{
#ifdef DEBUG
	freopen("cin.txt", "r", stdin);
	freopen("cout.txt", "w", stdout);
#endif
	int n,m,i,j,a,b;
 	while (~scanf("%d%d%d%d%d%d",&n,&m,&i,&j,&a,&b))
	{
		int k=0x3fffffff;
		if ((i==1 && j==1) || (i==1 && j==m) || (i==n && j==1) || (i==n && j==m))
		{
			printf("0\n");
			continue;
		}
		if (a>=n || b>=m)
		{
			printf("Poor Inna and pony!\n");
			continue;
		}
		if ((i-1)%a==0 && (j-1)%b==0 && ( (i-1)/a+(j-1)/b )%2==0)
			k=min(k,max((i-1)/a,(j-1)/b));
		if ((i-1)%a==0 && (m-j)%b==0 && ( (i-1)/a+(m-j)/b )%2==0)
			k=min(k,max((i-1)/a,(m-j)/b));
		if ((n-i)%a==0 && (m-j)%b==0 && ( (n-i)/a+(m-j)/b )%2==0)
			k=min(k,max((n-i)/a,(m-j)/b));
		if ((n-i)%a==0 && (j-1)%b==0 && ( (n-i)/a+(j-1)/b )%2==0)
			k=min(k,max((n-i)/a,(j-1)/b));	
		if (k==0x3fffffff) printf("Poor Inna and pony!\n");
			else printf("%d\n",k);
	}
	return 0;
}