#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    string weg = "";
    
    if(abs(i_start-i_end)%2!=0)
        cout << "Impossible" << endl;
    else if(abs(j_start-j_end)%2==1&&(i_start==i_end||abs(i_start-i_end)%4==0))
        cout << "Impossible" << endl;
    else if(i_start>i_end&&j_start>j_end){
        
    }
    else if(i_start>i_end&&j_start<j_end){
        
    }
    else if(i_start<i_end&&j_start>j_end){
        
    }
    else if(i_start<i_end&&j_start<j_end){
        
    }
}

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