#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
int n,m,x1,y1,x2,y2;
bool a[5001][5001],win[5001][5001];
int dis[5001][5001];
const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};
bool ok(int x,int y){
	return x>=1&&x<=n&&y>=1&&y<=m&&dis[x][y]==0&&a[x][y]==0;
}
void init(){
	memset(win,0,sizeof(win));
	int i=0;
	while(a[x1+i][y1]==0){
		win[x1+i][y1]=1;
		i++;
	}
	i=0;
	while(a[x1-i][y1]==0){
		win[x1-i][y1]=1;
		i++;
	}
	i=0;
	while(a[x1][y1+i]==0){
		win[x1][y1+i]=1;
		i++;
	}
	i=0;
	while(a[x1][y1-i]==0){
		win[x1][y1-i]=1;
		i++;
	}
}
queue<int> qx,qy;
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			//cout<<1;
			char t;
			cin>>t;
			a[i][j]=(t=='X');
		}
	}
	//cout<<2;
	while(1){
		int ans=1145140;
		cin>>x1>>y1>>x2>>y2;
		if(x1==0&&y1==0&&x2==0&&y2==0){
			break;
		}
		qx.push(x2),qy.push(y2);
		init();
		//cout<<1;
		while(!qx.empty()){
			
			int x=qx.front(),y=qy.front();
			//cout<<x<<" "<<y<<endl;
			qx.pop(),qy.pop();
			for(int i=0;i<4;i++){
				int nx=x+dx[i],ny=y+dy[i];
				if(ok(nx,ny)){
					dis[nx][ny]=dis[x][y]+1;
					ans=min(ans,dis[nx][ny]);
					qx.push(nx),qy.push(ny);
				}
			}
		}
		if(ans==1145140)cout<<"Poor Harry\n";
		else cout<<ans<<"\n";
	}
	return 0;
}

在线ide也RE