#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i1, int j1, int i2, int j2)
{
    //  Print the distance along with the sequence of moves.
    if((i1%2)==0 && (i2%2)!=0 || (i1%2)!=0 && (i2%2)==0)
    {
         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;
}