#include <bits/stdc++.h>

using namespace std;

bool check(int x,int y,int n) {
    if(x<0 || x >=n) return false;
    if(y<0 || y>=n) return false;
    return true;
}

void bfs(int x,int y,vector< vector <int > >& visit,vector< vector <int > >& parent) {
    int n = visit.size();
    queue< pair<int,int> > Q;
    Q.emplace(x,y);
    visit[x][y] = 1;
    while(!Q.empty()) {
        int i=Q.front().first,j=Q.front().second;
        int v = visit[i][j];
        Q.pop();
        if(check(i+2,j,n) && visit[i+2][j]) {
            visit[i+2][j] = v+1;
            parent[i+2][j] = 1; //R
            Q.emplace(i+2,j);
        }
        if(check(i-2,j,n) && visit[i-2][j]) {
            visit[i-2][j] = v+1;
            parent[i-2][j] = 2; //L
            Q.emplace(i-2,j);
        }
        if(check(i+1,j+2,n) && visit[i+1][j+2]) {
            visit[i+1][j+2] = v+1;
            parent[i+1][j+2] = 3; //UR
            Q.emplace(i+1,j+2);
        }
        if(check(i-1,j+2,n) && visit[i-1][j+2]) {
            visit[i-1][j+2] = v+1;
            parent[i-1][j+2] = 4; //UL
            Q.emplace(i-1,j+2);
        }
        if(check(i+1,j-2,n) && visit[i+1][j-2]) {
            visit[i+1][j-2] = v+1;
            parent[i+1][j-2] = 5; //LR
            Q.emplace(i+1,j-2);
        }
        if(check(i-1,j-2,n) && visit[i-1][j-2]) {
            visit[i-1][j-2] = v+1;
            parent[i-1][j-2] = 6; //LL
            Q.emplace(i-1,j-2);
        }
    }
}

int main() {
    int n;
    int p,q,r,s;
    cin >> n >> p >> q >> r >> s;
    vector< vector <int > > visit(n);
    for(int i=0;i<n;i++) visit[i].reserve(n);
    vector< vector <int > > parent(n);
    for(int i=0;i<n;i++) parent[i].reserve(n);
    bfs(p,q,visit,parent);
    if(visit[r][s]==0) {
        cout << "Impossible\n";
        return 0;
    }
    cout << visit[r][s]-1 << "\n";
    stack<int> S;
    
    
}