#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i, int j, int x, int y) {
    //  Print the distance along with the sequence of moves.
    if((abs(i-x)%2!=0))
    {cout<<"Impossible";return;}
    int m=abs(i-x);
    if(m%4==0&&(abs(y-j)%2!=0))
    {
        cout<<"Impossible";return;
    }
    if(m%4!=0&&(abs(y-j)%2==0))
    {
        cout<<"Impossible";return;
    }
         
}

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