#include <bits/stdc++.h>
#define P(X) printf("db %d\n",X);
#define ll long long
#define pii pair<int,int>
#define x first
#define y second
#define pb push_back
#define rep(i,n) for(i=1;i<=n;i++)
#define FO freopen("t.txt","w",stdout);
using namespace std;
int a[222][222],xs,xe,ys,ye,n;
void dfs(int x,int y,int mov)
{
    if(x<0||y<0||x==n||y==n)    return;
    if(mov>=a[x][y]) return;
    a[x][y]=mov;  //  cout<<x<<" "<<y<<endl;
    if(x==xs&&y==ys)    return;
    dfs(x,y+2,mov+1);
    dfs(x,y-2,mov+1);
    dfs(x-2,y+1,mov+1);
    dfs(x-2,y-1,mov+1);
    dfs(x+2,y+1,mov+1);
    dfs(x+2,y-1,mov+1);
}
void ans(int x,int y)
{
    if(a[x][y]==1)  return;   //  cout<<x<<" "<<y<<endl;
    //cout<<a[x][y]<<endl;
    if(a[x][y]-1==a[x-2][y-1]){
        printf("UL ");  ans(x-2,y-1);
    }
    else if(a[x][y]-1==a[x-2][y+1]){
        printf("UR ");  ans(x-2,y+1);
    }
    else if(a[x][y]-1==a[x][y+2]){
        printf("R ");  ans(x,y+2);
    }
    else if(a[x][y]-1==a[x+2][y+1]){
        printf("LR ");  ans(x+2,y+1);
    }
    else if(a[x][y]-1==a[x+2][y-1]){
        printf("LL ");  ans(x+2,y-1);
    }
    else if(a[x][y]-1==a[x][y-2]){
        printf("L ");  ans(x,y-2);
    }
}
int main()
{
   // freopen("test.txt","r",stdin);
    int i,j;
    scanf("%d",&n);
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)    a[i][j]=99999999;
    scanf("%d %d %d %d",&xs,&ys,&xe,&ye);
    dfs(xe,ye,1);       //P(a[xe][ye])
    if(a[xs][ys]==99999999) printf("Impossible");
    else{
        printf("%d\n",a[xs][ys]-1);
        ans(xs,ys);
    }
    return 0;
}