import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        //  Print the distance along with the sequence of moves.
        
        int visited[][]=new int[n][n];
        Queue<Integer> q=new LinkedList<Integer>();
        int parentx[][]=new int[n][n];
        int parenty[][]=new int[n][n];
        int distance[][]=new int[n][n];
        int i=0,j=0;
        
        for(i=0;i<n;++i)
        {
            for(j=0;j<n;++j)
            {
                parentx[i][j]=-1;
                parenty[i][j]=-1;
                distance[i][j]=Integer.MAX_VALUE;
            }
        }
        
        distance[i_start][j_start]=0;
        
        q.add(i_start);
        q.add(j_start);
        //visited[i_start][j_start]=1;
        
        int g=0;
        
        while(!q.isEmpty())
        {
            int x=q.peek();
            q.remove();
            int y=q.peek();
            q.remove();
            
            if(x==i_end && y==j_end)
            {
                g=1;
                break;
            }
            
            visited[x][y]=1;
            
            int dt=distance[x][y]+1;
            
            int cx=x-2,cy=y-1;
            int ix[]={-2,-2,0,2,2,0};
            int iy[]={-1,1,2,1,-1,-2};
            
            for(i=0;i<6;++i)
            {
                cx=x+ix[i];
                cy=y+iy[i];
                
                if(cx>=0 && cx<n && cy>=0 && cy<n)
                {
                     if(visited[cx][cy]==0)
                     {
                         
                         parentx[cx][cy]=x; 
                         parenty[cx][cy]=y; //System.out.println("Parent of "+cx+","+cy+"  is  "+x+" , "+y);
                         q.add(cx);
                         q.add(cy);
                         distance[cx][cy]=dt;
                         visited[cx][cy]=1;
                     }
                
                     else
                     {
                         if(distance[cx][cy]>dt)
                         {
                             distance[cx][cy]=dt;
                             parentx[cx][cy]=x;
                             parenty[cx][cy]=y; //System.out.println("Parent of "+cx+","+cy+"  is  "+x+" , "+y);
                             q.add(cx);
                             q.add(cy);
                        
                         }
                      }
                
                 }
                
            }
         
            
            
        }
        
        
        if(g==0)
        {
            System.out.println("Impossible");
            return;
        }
        
        
        int x=i_end,y=j_end;
        System.out.println(distance[x][y]);
        //System.out.println(x+" "+y);
        //int dst=distance[x][y];
        ArrayList<String> path=new ArrayList<String>();
        while( (x!=i_start || y!=j_start) && (x>=0 && y>=0 && x<n && y<n) )
        {
            int xx=parentx[x][y];
            int yy=parenty[x][y];
            //x=xx;
            //y=yy;
            //System.out.println(xx+"  "+yy);
            if(xx-2==x && yy-1==y)
            {
                path.add("UL");
            }
            else if(xx-2==x && yy+1==y)
            {
                path.add("UR");
            }
            else if(xx==x && yy+2==y)
            {
                path.add("R");
            }
            else if(xx+2==x && yy+1==y)
            {
                path.add("LR");
            }
            else if(xx+2==x && yy-1==y)
            {
                path.add("LL");
            }
            else if(xx==x && yy-2==y)
            {
                path.add("L");
            }
            x=xx;
            y=yy;
        }
        
        for(i=path.size()-1;i>=0;--i)
        {
            System.out.print(path.get(i)+" ");
        }
        
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int i_start = in.nextInt();
        int j_start = in.nextInt();
        int i_end = in.nextInt();
        int j_end = in.nextInt();
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}