#include<bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define mpa make_pair
using namespace std;
typedef long long LL;

int dx[8] = {2, -2, 1, 1, -1, -1};
int dy[8] = {0, 0, 2, -2, 2, -2};

bool valid(int x, int y, int N, int M) {
    if(x <= 0 || y <= 0 || x > N || y > M)
            return false;
    return true;
}

int bfs(pair<int, int> p1, pair<int, int> p2, pair<int, int> p3) {

	int N = p3.ff;
    int M = p3.ss;
    queue<pair<pair<int, int>, int> > Que;
    map<pair<int, int>, bool> Vis;

    Que.push(mpa(p1, 0));

    while(!Que.empty()) {

	    pair<pair<int, int>, int> temp = Que.front();
	    Que.pop();

        if(temp.ff.ff == p2.ff && temp.ff.ss == p2.ss)
                return temp.ss;
        int x = temp.ff.ff;
        int y = temp.ff.ss;
        int dis = temp.ss + 1;


        if(Vis.count(mpa(x, y)))
            continue;
        Vis[mpa(x, y)] = true;

        for(int i = 0; i < 8; ++i) {

		    int x1 = x + dx[i];
            int y1 = y + dy[i];
            if(valid(x1, y1, N, M))
            Que.push(mpa(mpa(x1, y1), dis));
        }

    }

    return -1;
}

int solve(int N, int M, int x1, int y1, int x2, int y2) {

    pair<int, int> p1;
    p1.ff = x1;
    p1.ss = y1;

    pair<int, int> p2;
    p2.ff = x2;
    p2.ss = y2;

    pair<int, int> p3;
    p3.ff = N;
    p3.ss = M;

    int ans = bfs(p1, p2, p3);
    return ans;
}

int main() {
    int n , x1,x2,y1,y2 ;
    cin>>n ;
    cin>>x1>>y1>>x2>>y2 ;
	int x= solve(n, n, x1, y1, x2, y2) ;
	if(x<0) cout<<"Impossible" ;
	return 0;
}