#include<iostream>

 #include<cstring>

 #include<queue>

 using namespace std;

 int t,n,x1,y1,x2,y2;

 int dx[]={-,,,,,-,-,-},dy[]={,,,-,-,-,-,};

 bool f[][];

 struct node

 {

     int x,y,step;

 };

 int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=x*+ch-;ch=getchar();}

     return x*f;

 }

 void bfs()

 {

     node h;

     h.x=x1;h.y=y1;h.step=;

     queue<node>q;

     q.push(h);

     f[h.x][h.y]=;

     while(!q.empty())

     {

         node k=q.front();

         q.pop();

         for(int i=;i<=;i++)

         {

             int xx=k.x+dx[i],yy=k.y+dy[i];

             if(f[xx][yy]||xx<||yy<||xx>n||yy>n)continue;

             node pus;

             pus.x=xx;pus.y=yy;pus.step=k.step+;

             f[xx][yy]=;

             if(xx==x2&&yy==y2)

             {

                 cout<<pus.step<<endl;

                 return;

             }

             q.push(pus);

         }

     }

 }

 int main()

 {

     //freopen("1.in","r",stdin);

     t=read();

     while(t--)

     {

         memset(f,,sizeof(f));

         n=read();x1=read();y1=read();x2=read();y2=read();

         if(x1==x2&&y1==y2)cout<<<<endl;

         bfs();

     }

     return ;

 }