#include using namespace std; void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) { int x=j_end-j_start; int y=i_end-i_start; int m=0; int q=0; char a,b,c; if(y%2!=0){ cout<< "Impossible"<=x){ m=y; cout << m<=x){ m=y; cout << m<> 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; }