#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int x=i_end-i_start,y=j_end-j_start;
    int i,j,t=1,z=0;
    if(x>0){i=1;}else{i=0;x=-x;}if(y>0){j=1;}else{j=0;y=-y;}
    if(x&1){cout<<"Impossible";t=0;}else if((x/2)%2!=y%2){cout<<"Impossible";t=0;}
    
        
    }


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