#include <bits/stdc++.h>   using namespace std;   const int inf = 0x3f3f3f3f;   int n, m, i, j, a, b;   long long check(long long x, long long y) {     if (x == i && y == j) return 0;     if (abs(x - i) % a != 0 || abs(y - j) % b != 0) return inf;     if (abs(abs(x - i) / a - abs(y - j) / b) & 1) return inf;     if ((i - a < 1 && i + a > n) || (j - b < 1 && j + b > m))       return inf;     else       return max(abs(x - i) / a, abs(y - j) / b);   }   int main() {     scanf( %d%d%d%d%d%d , &n, &m, &i, &j, &a, &b);     long long ret = inf;     ret = min(check(1, m), check(n, 1));     ret = min(ret, check(n, m));     ret = min(ret, check(1, 1));     if (ret == inf)       printf( Poor Inna and pony! n );     else       printf( %d n , ret);   }   