#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int a1, int a2, int b1, int b2) {
    //  Print the distance along with the sequence of moves.
    if((abs(b1-a1))%2)
        cout<<"Impossible";
    else{
        if(abs(b2+(abs(b1-a1)/2)-a2)%2)
            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;
}