#include using namespace std; int main() { int i,j,k,n,t; cin>>n; k=n*n; vector adj[k+1]; map > mymap; int p=1; for(j=0;j=0&&k-1>=0) { adj[p].push_back(p-2*n-1); mymap[p][p-2*n-1]=0; } if(j-2>=0&&k+1=0) { adj[p].push_back(p+2*n-1); mymap[p][p+2*n-1]=4; } if(k-2>=0) { adj[p].push_back(p-2); mymap[p][p-2]=5; } p++; } } int x1,y1,x2,y2; cin>>x1>>y1>>x2>>y2; int p1=x1*n+y1+1; int p2=x2*n+y2+1; vector par(n*n+1,0); queue q; q.push(p1); vector vis(n*n+1,false); vector length(n*n+1,0); vis[p1]=true; while(!q.empty()) { int u1=q.front(); q.pop(); for(j=0;j v; k=p2; if(vis[p2]==false) cout<<"Impossible"<=0;j--) { if(mymap[v[j+1]][v[j]]==0) cout<<"UL "; if(mymap[v[j+1]][v[j]]==1) cout<<"UR "; if(mymap[v[j+1]][v[j]]==2) cout<<"R "; if(mymap[v[j+1]][v[j]]==3) cout<<"LR "; if(mymap[v[j+1]][v[j]]==4) cout<<"LL "; if(mymap[v[j+1]][v[j]]==5) cout<<"L "; } cout<