#include<bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int arr[201][201];
    int parentx[201][201];
    int parenty[201][201];
    int visited[201][201]={0};
    int i,j;
    for (i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            arr[i][j]=9999; 
            parentx[i][j]=-1;
            parenty[i][j]=-1;
        }
    }
    
    int count;
    
    int sx,sy,ex,ey;
    cin>>sx>>sy>>ex>>ey;
    pair<int ,int > start=make_pair(sx,sy);
    pair<int,int> end=make_pair(ex,ey);
     queue< pair<int,int> > pq;
    
    pq.push(start);
    visited[sx][sy]=1;  
      
    pair<int,int > var;
    
    arr[sx][sy]=0;
    parentx[sx][sy]=9999;
    parenty[sx][sy]=9999;
    while(!pq.empty())
    {
        var=pq.front();
        pq.pop();
           // cout<<pq.empty()<<endl;
        count=arr[var.first][var.second]+1;
        
            
            //cout<<var.first<<"  "<<var.second<<endl;
            
            
            
            if((var.first-2)>=0  && (var.second-1)>=0 )
        {
            if(arr[var.first-2][var.second-1]>count  && visited[var.first-2][var.second-1]==0)
            {
                arr[var.first-2][var.second-1]=count;
                pq.push(make_pair(var.first-2,var.second-1));
                    visited[var.first-2][var.second-1]=1;
                parentx[var.first-2][var.second-1]=var.first;
                 parenty[var.first-2][var.second-1]=var.second;
            }
                 else;
            
        }
            
             if((var.first-2)<n && (var.second+1)>=0)
        {
            if(arr[var.first-2][var.second+1]>count  && visited[var.first-2][var.second+1]==0)
            {
                arr[var.first-2][var.second+1]=count;
                pq.push(make_pair(var.first-2,var.second+1));
                    visited[var.first-2][var.second+1]=1;
                parentx[var.first-2][var.second+1]=var.first;
                 parenty[var.first-2][var.second+1]=var.second;  
            }
            else;
        }
        
           
            if((var.second+2)<n )
        {
            if(arr[var.first][var.second+2]>count  && visited[var.first][var.second+2]==0)
            {
                arr[var.first][var.second+2]=count;
                pq.push(make_pair(var.first,var.second+2));
                    visited[var.first][var.second+2]=1;
                parentx[var.first][var.second+2]=var.first;
                 parenty[var.first][var.second+2]=var.second;
            }
                 else;
            
        }
            
             if( (var.first+2)<n  && (var.second+1)<n)
        {
            if(arr[var.first+2][var.second+1]>count  && visited[var.first+2][var.second+1]==0)
            {
                arr[var.first+2][var.second+1]=count;
                pq.push(make_pair(var.first+2,var.second+1));
                    visited[var.first+2][var.second+1]=1;
                parentx[var.first+2][var.second+1]=var.first;
                 parenty[var.first+2][var.second+1]=var.second;
            }
            else;
        }
            
             if((var.first+2)>=0  && (var.second-1)<n)
        {
            if(arr[var.first+2][var.second-1]>count  && visited[var.first+2][var.second-1]==0)
            {
                arr[var.first+2][var.second-1]=count;
                pq.push(make_pair(var.first+2,var.second-1));
                     visited[var.first+2][var.second-1]=1;
                parentx[var.first+2][var.second-1]=var.first;
                 parenty[var.first+2][var.second-1]=var.second;
            }
            else;
        }
            
        if((var.second-2)>=0 )
        {
            if(arr[var.first][var.second-2]>count && visited[var.first][var.second-2]==0)
            {
                arr[var.first][var.second-2]=count;
                    visited[var.first][var.second-2]=1;
                pq.push(make_pair(var.first,var.second-2));
                parentx[var.first][var.second-2]=var.first;
                 parenty[var.first][var.second-2]=var.second;
            }
                else;
            
        }
         
            if(var.first==ex && var.second==ey)
                    break;
        
    }
        
        

        
        
    if(arr[ex][ey]==9999)
        cout<<"Impossible"<<endl;
    else
    {
            
            cout<<arr[ex][ey]<<endl;
            
            //cout<<ex<<"  "<<ey<<endl;
            stack<string >sp;
            
            while(ex!=sx || ey!=sy)
            {
                  if(ex-parentx[ex][ey]==-2 && ey-parenty[ex][ey]==-1)
                    sp.push("UL");
                 else if(ex-parentx[ex][ey]==-2 && ey-parenty[ex][ey]==1)
                   sp.push("UR"); 
                else if(ex-parentx[ex][ey]== 0&& ey-parenty[ex][ey]==2)
                   sp.push("R");
                 else if(ex-parentx[ex][ey]==2 && ey-parenty[ex][ey]==1)
                   sp.push("LR");
                 else if(ex-parentx[ex][ey]==2 && ey-parenty[ex][ey]==-1)
                   sp.push("LL");
                else if(ex-parentx[ex][ey]==0&& ey-parenty[ex][ey]==-2)
                   sp.push("L");
            
                    int kex,key;
                    kex=ex;key=ey;
                ex=parentx[kex][key];
                ey=parenty[kex][key];
                    
                   // cout<<ex<<"  "<<ey<<endl;
            }
            while(!sp.empty())
            {
                    cout<<sp.top()<<" ";
                    sp.pop();
            }
            cout<<endl;
    } 
    
    return 0;
}