#include <bits/stdc++.h>

using namespace std;

int vis[222][222]={0},sx,sy;
void f(int x,int y)
{
    if(x==sx && y==sy) return;
    if(vis[x][y]==1) {f(x+2,y+1);cout<<"UL ";}
    if(vis[x][y]==2) {f(x+2,y-1);cout<<"UR ";}
    if(vis[x][y]==3) {f(x,y-2);cout<<"R ";}
    if(vis[x][y]==4) {f(x-2,y-1);cout<<"LR ";}
    if(vis[x][y]==5) {f(x-2,y+1);cout<<"LL ";}
    if(vis[x][y]==6) {f(x,y+2);cout<<"L ";}
    
}
int main() {
    int n,ex,ey,d[222][222],x,y,ok=0;
    cin>>n;
    cin>>sx>>sy>>ex>>ey;
    d[sx][sy]=0;
    queue<pair<int,int>>q;
    q.push({sx,sy});
    vis[sx][sy]=1;
    while(!q.empty())
    {
        pair<int,int>p=q.front();
        x=p.first;
        y=p.second;
        q.pop();
        if(x==ex && y==ey) {cout<<d[x][y]<<endl; f(x,y); ok=1; break;}
        if(x-2>=0 && y-1>=0 && vis[x-2][y-1]==0) q.push({x-2,y-1}),vis[x-2][y-1]=1,d[x-2][y-1]=d[x][y]+1;
        if(x-2>=0 && y+1<n && vis[x-2][y+1]==0) q.push({x-2,y+1}),vis[x-2][y+1]=2,d[x-2][y+1]=d[x][y]+1;
        if(y+2<n && vis[x][y+2]==0) q.push({x,y+2}),vis[x][y+2]=3,d[x][y+2]=d[x][y]+1;
        if(x+2<n && y+1<n && vis[x+2][y+1]==0) q.push({x+2,y+1}),vis[x+2][y+1]=4,d[x+2][y+1]=d[x][y]+1;
        if(x+2<n && y-1>=0 && vis[x+2][y-1]==0) q.push({x+2,y-1}),vis[x+2][y-1]=5,d[x+2][y-1]=d[x][y]+1;
        if(y-2>=0 && vis[x][y-2]==0) q.push({x,y-2}),vis[x][y-2]=6,d[x][y-2]=d[x][y]+1;
    }
 
    if(ok==0) cout<<"Impossible";
    return 0;
}