#include using namespace std; int main() { int i,j,k,n,m; int i1,i2,j1,j2,o=0; cin>>n; cin>>i1>>j1>>i2>>j2; vectorv; v.clear(); while((i1!=i2 || j1!=j2) && (i1>=0&&j1>=0) && (i1<=n-1 && j1<=n-1) ) { if(i1-i2>=2) { if(j1-j2 >=1) { v.push_back("UL"); i1-=2; j1-=1; } else if(j2-j1>=1) { v.push_back("UR"); i1-=2; j1+=1; o=1; } else if(j1==j2) { while(i1!=i2) { v.push_back("UL"); i1-=2; j1-=1; if(i1!=i2){v.push_back("UR");i1-=2;j1+=1;} } while(j2!=j1) { v.push_back("R"); j1+=2; } } } else if(i2==i1) { if(j1-j2>=2){ v.push_back("L"); j1-=2; o=1; } else if(j2-j1>=2) { v.push_back("R"); j1+=2; o=1; } else { o=3;break; } } else if(i2-i1>=2) { if(j1-j2 >=1){ v.push_back("LL"); i1+=2; j1-=1; } else if(j2-j1>=1) { v.push_back("LR"); i1+=2; j1+=1; o=1; } else if(j1==j2) { while(i1!=i2) { v.push_back("LR"); i1+=2; j1+=1; if(i1!=i2){v.push_back("LL");i1+=2;j1-=1;} } while(j2!=j1) { v.push_back("L"); j1-=2; } } } else { o=3; break; } } if(i1<0 || j1<0 || i1>n-1 || j1>n-1 || o==3) { cout<<"Impossible";return 0; } if(v.size()==0){cout<