1. Inna and Pink Pony

1. Inna and Pink Pony

 首先找出四个边界点，但要注意当横纵坐标等于边界横纵坐标时，需考虑是否会出界；满足以上条件时，考虑横纵坐标移动次数其和为偶数时便可以完成移动（因为正负抵消原则），话不多说，直接上Python代码。

n,m,i,j,a,b=map(int,input().split())
k=1000000
while True:
    if (i==1 and j==1) or (i==1 and j==m) or (i==n and j==1) or (i==n and j==m):
        print(0)
        break
    if a>=n or b>=m:
       print("Poor Inna and pony!")
       break
    if (i-1)%a==0 and (j-1)%b==0 and ((i-1)//a+(j-1)//b)%2==0:
       k=min(k,max((i-1)//a,(j-1)//b))
    if (i-1)%a==0 and (m-j)%b==0 and ((i-1)//a+(m-j)//b)%2==0:
       k=min(k,max((i-1)//a,(m-j)//b))
    if (n-i)%a==0 and (m-j)%b==0 and ((n-i)//a+(m-j)//b)%2==0:
       k=min(k,max((n-i)//a,(m-j)//b))
    if (n-i)%a==0 and (j-1)%b==0 and ((n-i)//a+(j-1)//b)%2==0:
       k=min(k,max((n-i)//a,(j-1)//b)) 
    if k==1000000:
        print("Poor Inna and pony!")
        break
    else:
        print(k)
        break