#include <bits/stdc++.h>

using namespace std;
vector<tuple<int, int>> p(int x, int y)
{
    vector<tuple<int, int>> v;
    v.push_back(make_tuple(x-1, y+2));
    v.push_back(make_tuple(x+1, y+2));
    v.push_back(make_tuple(x+1, y));
    v.push_back(make_tuple(x+1, y-2));
    v.push_back(make_tuple(x-1, y-2));
    v.push_back(make_tuple(x-1, y));
    return v;
}
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    tuple<int, int> dest = make_tuple(i_end, j_end);
    queue<tuple<int, int>> q;
    q.push(make_tuple(i_start, i_end));
    while(queue.back()!=dest)
    {
        
    }
}

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;
}