poj 1915//简单bfs

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define inf 0x100000


typedef pair<int,int> p;
int t,n,bx,by,ex,ey,ans;
int dx[8] = {1,2,2,1,-1,-2,-2,-1},dy[8] = {2,1,-1,-2,2,1,-1,-2},d[301][301];


void solve(int x,int y){
for(int i = 0;i<n;++i){
for(int j = 0;j<n;++j){
d[i][j] = inf;
}
}
queue<p> que;
que.push(p(x,y));
d[x][y] = 0;
while(que.size()){
p pp = que.front();
que.pop();
if(pp.first == ex&&pp.second == ey){
ans = d[ex][ey];
return;
}
for(int i = 0;i<8;++i){
int xx = pp.first+dx[i];
int yy = pp.second+dy[i];
if(xx >= 0&&xx < n&&yy >=0 && yy<n&&d[xx][yy] == inf){
que.push(p(xx,yy));
d[xx][yy] = d[pp.first][pp.second] + 1;
}
}
}
}


int main(){
cin>>t;
while(t--){
cin>>n;
cin>>bx>>by>>ex>>ey;
if(bx == ex&&by == ey)
cout<<"0\n";
else{
ans = 0;
solve(bx,by);
cout<<ans<<endl;
}
}
return 0;
}