#include<iostream>

using namespace std;

#define SIZE 305

int vis[SIZE][SIZE];

int sx,sy,ex,ey;

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

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

int n,case_num;

typedef struct node

{

    int x;

    int y;

    int step;

}node;

node queue[SIZE*SIZE];

void bfs()

{

    int head,tail;

    head=tail=;

    node startnode;

    startnode.x=sx;

    startnode.y=sy;

    startnode.step=;

    queue[tail++]=startnode;

    vis[startnode.x][startnode.y]=;

    node cur,next;

    while(head!=tail)

    {

        int nx,ny;

        cur=queue[head++];

        if(cur.x==ex&&cur.y==ey)

        {

            cout<<cur.step<<endl;

            return;

        }

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

        {

            nx=cur.x+dx[i];

            ny=cur.y+dy[i];

            if(nx>=&&nx<n&&ny>=&&ny<n&&vis[nx][ny]==)

            {

                next.x=nx;

                next.y=ny;

                next.step=cur.step+;

                queue[tail++]=next;

                vis[next.x][next.y]=;

            }

        }

    }

}

int main()

{

    //freopen("input.txt","r",stdin);

    cin>>case_num;

    while(case_num--)

    {

        cin>>n;

        cin>>sx>>sy>>ex>>ey;

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

            for(int j=;j<n;j++)

                vis[i][j]=;

        bfs();

    }

    return ;

}