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

struct pixel
{
  int x,y;  
  int d;
   // int px,py;
    vector <pixel> v;
   // queue <int> p;
   //vector <int> moves;
};

bool insideBorders(int x,int y,int n)
{
    if(x<=n && x>=0 && y>=0 && y<=n)
       return true;
       
     return false;
}

string findName(int i)
{
    string name;
    switch(i)
                {
                        case -1:  name ="UL";break;
                        case -3:  name="UR";break;
                        case -2:  name="R";break;
                        case 1:   name ="LR";break;
                        case 3:  name="LL";break;
                        case 2:  name="L";break;
                }
    
    return name;
}

//apply bfs to code 
vector <string> moves;

int minstepbfs(int kx,int ky,int tx,int ty,int n)
{
    //listing possible moves
    //int moves=0;
    int xarr[]={-2, -2, 0, 2, 2, 0};
    int yarr[]={-1, 1, 2, 1, -1, -2};
    
    bool vis[n+1][n+1];
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j<=n;j++)
        {
            vis[i][j]=false;
        }
    }
    //map <pixel,pixel> parent;
    queue <pixel> q;
    //queue <int> p;
    pixel end;
    pixel c,t;
    c.x=kx;
    c.y=ky;
    c.d=0;
    q.push(c);
   // parent.insert(make_pair(c,root));
    vis[kx][ky]=true;
    
    while(!q.empty())
    {
        t=q.front();
        q.pop();
         vis[t.x][t.y]=true;
         
       /* if(!visited[t.x][t.y])
        {
            visited[t.x][t.y]=true;
        }
        */
        if(t.x==tx && t.y==ty)
        {
         //cout<<t.px<<" "<<t.py<<endl;
          //  cout<<t.v.size()<<endl;
            pixel par,ch;
           par=t.v[0];
            ch=t;
            while(ch.x!=kx || ch.y!=ky)
            {
                int px,py,cx,cy;
                px=par.x;
                py=par.y;
                
                cx=ch.x;
                cy=ch.y;
                
                //cout<<"child"<<cx<<" "<<cy<<"parent"<<px<<" "<<py<<endl;
                
                int xdiff=cx-px;
                int ydiff=cy-py;
                
                //cout<<xdiff<<" "<<ydiff<<endl;
                
                int totdiff=xdiff-ydiff;
                
                string s= findName(totdiff);
                moves.push_back(s);
                
                ch=par;
                par=par.v[0];
            }
            
            return t.d;
            
        }
        
        
        
       
        for(int i=0;i<6;i++)
        {
            pixel a;
            a.x=t.x+xarr[i];
            a.y=t.y+yarr[i];
            
            if(insideBorders(a.x,a.y,n) && !vis[a.x][a.y])
            {
               a.d=t.d+1;
               //p.push(i);
               // moves.push_back(i);
                 //a.px=t.x;
                //a.py=t.y;
               a.v.push_back(t);
                q.push(a);
               
                
            }
            
        }
        
        
    }
    
    return -1;
}


int main()
 {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	

	    int n;
	    cin>>n;
	    
	    int kx,ky;
	    cin>>kx>>ky;
	    
	    int tx,ty;
	    cin>>tx>>ty;
	    
     //vector <string> moves;
	    
	    int res=minstepbfs(kx,ky,tx,ty,n);
	    
	    if(res==-1)
        {
            cout<<"Impossible"<<endl;
        }
    else
    {
        cout<<res<<endl;
        for(int y=moves.size()-1;y>=0;y--)
           {
               cout<<moves[y]<<" ";
           }
    }
    
    
	return 0;
}