#include<bits/stdc++.h>
using namespace std;

int n,sx,sy,dx,dy;
string parr[6]={"UL","UR","R","LR","LL","L"};
int PATH[400];


void dfsUtil(int scx,int scy,int path[400],int len,bool vis[][200],int *minlen,int val){
        int xa[6]={-2,-2,0,2,2,0};
        int ya[6]={-1,1,2,1,-1,-2};
    
        vis[scx][scy]=true;
    if(val > -1)
        path[len++]=val;
        
        if(scx==dx && scy==dy && len < *minlen){
            *minlen = len;
            for(int i=0;i<len;i++){
                PATH[i]=path[i];
            }
        }
        else{
            for(int i=0;i<6;i++){
                if(scx+xa[i]>=0 && scx+xa[i]<n && scy+ya[i]>=0 && scy+ya[i]<n && vis[scx+xa[i]][scy+ya[i]]==false){
                    dfsUtil(scx+xa[i],scy+ya[i],path,len,vis,minlen,i);
                }
            }
        }
    len--;
    vis[scx][scy]=false;
    
    
}


void dfs(){
    int path[200];
    int minlen=400;
    bool vis[200][200];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            vis[i][j]=false;
        }
    }
    
    dfsUtil(sx,sy,path,0,vis,&minlen,-1);
    if(minlen<400){
        cout<<minlen<<endl;
        for(int i=0;i<minlen;i++){
            cout<<parr[PATH[i]]<<" ";
        }
        cout<<endl;
    }
    else{
        cout<<"Impossible"<<endl;
    }
        
    
}


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    cin>>n;
    cin>>sx;
    cin>>sy;
    cin>>dx;
    cin>>dy;
    
    dfs();
    
    return 0;
}