// C++ program to find minimum steps to reach to
// specific cell in minimum moves by Knight
#include <bits/stdc++.h>
using namespace std;

// structure for storing a cell's data
void printShortestPath(int N, int i_start, int j_start, int i_end, int j_end){
    cout<<"Impossible";
}


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