#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    if((i_start == j_start)  && ((j_end - i_end) % 2)) {
        cout << "Impossible" << endl;
        return;
    }
    if((j_end == i_end)  && ((i_start - j_start) % 2)) {
        cout << "Impossible" << endl;
        return;
    }
    if(((i_start - i_end) % 2) || !((j_start - j_end) % 2)) {
        cout << "Impossible" << endl;
        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;
}