//By Abhinav //Code your heart out #include using namespace std; typedef long long int ll; #define mem(x,val) memset(x,val,sizeof(x)) #define SupHomey ios_base::sync_with_stdio(false),cin.tie(NULL) #define FR(i,a,b) for(ll i=a;i >qu; qu.push(mp(x1,y1)); visit[x1][y1]=true; while(!qu.empty()){ int lim=qu.size(); while(lim--){ paircurr = qu.front(); qu.pop(); for(int i=0;i<6;i++){ if(curr.first+x[i]=0 and curr.second+y[i]=0 and !visit[curr.first+x[i]][curr.second+y[i]]) qu.push(mp(curr.first+x[i],curr.second+y[i])),visit[curr.first+x[i]][curr.second+y[i]]=true,trace[curr.first+x[i]][curr.second+y[i]]=i,cnt[curr.first+x[i]][curr.second+y[i]]=cnt[curr.first][curr.second]+1; } if(visit[x2][y2]) return; } } } int main(){ SupHomey; int n; cin>>n; FR(i,0,202) FR(j,0,202) visit[i][j]=false,trace[i][j]=-1,cnt[i][j]=0; mapmymap; mymap[0]="UL"; mymap[1]="UR"; mymap[2]="R"; mymap[3]="LR"; mymap[4]="LL"; mymap[5]="L"; int startx,starty,endx,endy; cin>>startx>>starty>>endx>>endy; BFS(startx,starty,endx,endy,n); if(trace[endx][endy]==-1) cout<<"Impossible"<