#include #include #include #include #include using namespace std; int n,si,sj,ei,ej,k=0,pos[500]; void move(int num) { switch(num) { case 1: si=si-2; sj=sj-1; break; case 2: si=si-2; sj=sj+1; break; case 3: sj=sj+2; break; case 4: si=si+2; sj=sj+1; break; case 5: si=si+2; sj=sj-1; break; case 6: sj=sj-2; break; } pos[k++]=num; } int main() { cin>>n>>si>>sj>>ei>>ej; if((si-ei)%2==0) { while(si!=ei && sj!=ej) { while(eisj) //rightwards ur { move(2); } } while(ei==si && ej>sj) //rightwards r { move(3); if(ejsi) //downwards { if(ej>sj) //rightwards lr { move(4); } if(ej<=sj) //leftwards ll { move(5); } } while(ei==si && ejsj){ //crosses final location while moving left cout<<"Impossible"; exit(1); } } } cout<