#include<bits/stdc++.h>
using namespace std;
int n,r,c,s,k;
int q[100005][4],f=0,re=0,min=1000005,lev[205][205],i,j,l,len=0,pos;
/*char sh[7][3];
sh[0][0]="UL";
sh[1][0]="UR";
sh[2][0]="L";
sh[3][0]="R";
sh[4][0]="LL";
sh[5][0]="LR";*/
int arr[100005];
void check(int i,int j,int l,int path,int pi)
{
    if(i>=0 && i<n && j>=0 && j<n && l+1<lev[i][j])
    {
        re++;
        q[re][0]=i;
        q[re][1]=j;
        q[re][2]=path;
        q[re][3]=pi;
        lev[i][j]=l+1;
    }
}
void func(int pos)
{
    if(q[pos][3]<0)
    return;
    func(q[pos][3]);
    if(q[pos][2]==0)
        cout<<"UL ";
    else if(q[pos][2]==1)
        cout<<"UR ";
    else if(q[pos][2]==2)
        cout<<"L ";
    else if(q[pos][2]==3)
        cout<<"R ";
    else if(q[pos][2]==4)
        cout<<"LL ";
    else
        cout<<"LR ";
}
int main()
{
    cin>>n;
    cin>>r>>c>>s>>k;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            lev[i][j]=1000005;
    q[0][0]=r;
    q[0][1]=c;
    q[0][2]=1;
    q[0][3]=-1;
    lev[r][c]=0;
    while(f<=re)
    {
        i=q[f][0];
        j=q[f][1];
        if(i==s && j==k)
            break;
        l=lev[i][j];
        check(i-2,j-1,l,0,f);
        check(i-2,j+1,l,1,f);
        check(i,j+2,l,3,f);
        check(i+2,j+1,l,5,f);
        check(i+2,j-1,l,4,f);
        check(i,j-2,l,2,f);
        f++;
    }
    if(lev[s][k]==1000005)
        cout<<"Impossible"<<endl;
    else
    {
        cout<<lev[s][k]<<endl;
        pos=f;
        func(pos);
        cout<<endl;
    }
    
    return 0;
}