#include <bits/stdc++.h>

using namespace std;
struct cell
{
    int x, y;
    int dis;
    cell() {}
    cell(int x, int y, int dis) : x(x), y(y), dis(dis) {}
};
 bool isInside(int x, int y, int N)
{
    if (x >= 0 && x < N && y >= 0 && y < N)
        return true;
    return false;
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
   
    queue<cell> q;
 
int dy[] = {-1,1,2,1,-1,-2};
    int dx[] = {-2,-2,0,2,2,0};
    q.push(cell(i_start,j_start, 0));
 
    cell t;
    int x, y;
    bool visit[n][n];
 
    
    for (int i = 0; i <n; i++)
        for (int j = 0; j < n; j++)
            visit[i][j] = false;
 
   
    visit[i_start][j_start] = true;
 
   
    while (!q.empty())
    {
        t = q.front();
        q.pop();
        visit[t.x][t.y] = true;
 
        
        if (t.x == i_end && t.y == j_end)
          cout << t.dis;
 
 
      
        for (int i = 0; i < n; i++)
        {
            x = t.x + dx[i];
            y = t.y + dy[i];
 
           
            if (isInside(x, y, n) && !visit[x][y])
                q.push(cell(x, y, t.dis + 1));
 
        }
    }
}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}