#define ll long long int
void solve(){
    ll n; cin>>n;
    ll ax,ay; cin>>ax>>ay;
    ll bx,by; cin>>bx>>by;
    vector<vector<char>> arr(n+2,vector<char>(n+2,'.'));
    for(ll i=1;i<=n;i++) for(ll j=1;j<=n;j++) cin>>arr[i][j];
    vector< pair<ll,ll> > dir = {{1,1},{1,-1},{-1,1},{-1,-1}};

    vector<vector<ll>> dp(n+2,vector<ll>(n+2,1e18));
    queue<pair<ll,ll>> q;
    q.push({ax,ay});
    dp[ax][ay]=0;
    while(!q.empty()){
        auto elem = q.front();
        q.pop();
        for(int i=0;i<4;i++){
            int cx = elem.first,cy = elem.second;
            int dx = dir[i].first,dy = dir[i].second;
            while(true){
                cx+=dx; cy+=dy;
                if(cx<1 or cx>n or cy<1 or cy>n or arr[cx][cy]=='#' or dp[cx][cy]!=1e18 ) break;
                dp[cx][cy]=dp[elem.first][elem.second]+1;
                q.push({cx,cy});
            }
        }
    }
    if(dp[bx][by]==1e18) dp[bx][by]=-1;
    cout<<dp[bx][by]<<endl;
}