#include <bits/stdc++.h>
using namespace std;
 
//  structure for storing a cell's data
struct cell
{
    int x, y;
    int dis;
    cell() {}
    cell(int x, int y, int dis) : x(x), y(y), dis(dis) {}
};
 
//  Utility method returns true if (x, y) lies inside Board
bool isInside(int x, int y, int N)
{
    if (x >= 1 && x <= N && y >= 1 && y <= N)
        return true;
    return false;
}
 
//  Method returns minimum step to reach target position
int minStepToReachTarget(int knightPos[], int targetPos[],
                                                   int N)
{
    //  x and y direction, where a knight can move
    int dx[] = {-1,-1,-2,1,1,2};
    int dy[] = {-2,2,0,-2,2,0};
 
    //  queue for storing states of knight in board
    queue<cell> q;
 
    //  push starting position of knight with 0 distance
    q.push(cell(knightPos[0], knightPos[1], 0));
 
    cell t;
    int x, y;
    bool visit[N+1][N+1];
 
    //  make all cell unvisited
    for (int i = 0; i <= N-1; i++)
        for (int j = 0; j <= N-1; j++)
            visit[i][j] = false;
 
    //  visit starting state
    visit[knightPos[0]][knightPos[1]] = true;
 
    //  loop untill we have one element in queue
    while (!q.empty())
    {
        t = q.front();
        q.pop();
        visit[t.x][t.y] = true;
 
        // if current cell is equal to target cell,
        // return its distance
        if (t.x == targetPos[0] && t.y == targetPos[1])
            return t.dis;
 
 
        //  loop for all reahable states
        for (int i = 0; i < 6; i++)
        {
            x = t.x + dx[i];
            y = t.y + dy[i];
 
            // If rechable state is not yet visited and
            // inside board, push that state into queue
            if (isInside(x, y, N) && !visit[x][y])
                q.push(cell(x, y, t.dis + 1));
 
        }
    }
    return t.dis;
}
 
// Driver code to test above methods
int main()
{
    //  size of square board
    int N;
    cin>>N;
    int a,b,c,d;
    int knightPos[2];
    int targetPos[2];
    cin>>a>>b>>c>>d;
    knightPos[0]=a;
    knightPos[1]=b;
    targetPos[0]=c;
    targetPos[1]=d;
     if((a-c)>0 && (a-c)%2!=0)
     {
         cout<<"Impossible"<<endl;
     }
    else if((c-a)>0 && (c-a)%2!=0)
    {
        cout<<"Impossible"<<endl;
    }
    else
    {
        cout << minStepToReachTarget(knightPos, targetPos, N);
    }
    return 0;
}