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

public class Solution {
    
    
    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();
    }
    
    public static LinkedList<String> answer;

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        int[][] visited=new int[n][n];
        for(int c=0;c<n;c++){
            for(int d=0;d<n;d++){
                visited[c][d]=0;
            }
        }
        
        LinkedList<String> path=new LinkedList<String>();
        answer= new LinkedList<String>();
        findpath(i_start,j_start,visited,n,i_end,j_end,path);
        
        if(answer.size()==0){
            System.out.println("Impossible");
        }else{
            System.out.println(answer.size());
            for(String s5:answer){
                System.out.print(s5+" ");
            }
        }
        
        
    }

    
    public static void findpath(int x,int y,int[][] visited,int n,int vx,int vy,LinkedList<String> path){
		
		if(x==vx && y==vy){
			if(answer.size()==0){
                answer=path;
            }else{
                if(path.size()<answer.size()){
                    answer=path;
                }
                
            }
            
		}
		else{
		int[][] visitedupdate1=new int[n][n];
		int[][] visitedupdate2=new int[n][n];
		int[][] visitedupdate3=new int[n][n];
		int[][] visitedupdate4=new int[n][n];
        int[][] visitedupdate5=new int[n][n];
        int[][] visitedupdate6=new int[n][n];
            
		for(int k11=0;k11<n;k11++){
    		for(int k22=0;k22<n;k22++){
    			visitedupdate1[k11][k22]=visited[k11][k22];
    			visitedupdate2[k11][k22]=visited[k11][k22];
    			visitedupdate3[k11][k22]=visited[k11][k22];
    			visitedupdate4[k11][k22]=visited[k11][k22];
                visitedupdate5[k11][k22]=visited[k11][k22];
    			visitedupdate6[k11][k22]=visited[k11][k22];
    			
    		}
       	}
		LinkedList<String> path1=new LinkedList<String>();
        LinkedList<String> path2=new LinkedList<String>();
        LinkedList<String> path3=new LinkedList<String>();
        LinkedList<String> path4=new LinkedList<String>();
        LinkedList<String> path5=new LinkedList<String>();
        LinkedList<String> path6=new LinkedList<String>();
            
        for(String s1:path){
            path1.add(s1);
            path2.add(s1);
            path3.add(s1);
            path4.add(s1);
            path5.add(s1);
            path6.add(s1);
        }
            
		if(x<n-2){
            
            if(y<n-1){
                if(visited[x+2][y+1]==0){
                    visitedupdate2[x+2][y+1]=1;
                    path2.add("LR");
                    if(answer.size()==0 || (path2.size()<answer.size())){
                    findpath(x+2,y+1,visitedupdate2,n,vx,vy,path2);
                    }
                    }
                    
                }
                
            
            
            if(y>0){
                if(visited[x+2][y-1]==0){
                    visitedupdate1[x+2][y-1]=1;
                    path1.add("LL");
                    if(answer.size()==0 || (path1.size()<answer.size())){
                    findpath(x+2,y-1,visitedupdate1,n,vx,vy,path1);}
                }
            }
        }			
        
		
		if(x>1){
            if(y>0){
                if(visited[x-2][y-1]==0){
                    visitedupdate3[x-2][y-1]=1;
                    path3.add("UL");
                    if(answer.size()==0 || (path3.size()<answer.size())){
                    findpath(x-2,y-1,visitedupdate3,n,vx,vy,path3);}
                }
                
            }
            
            if(y<n-1){
                if(visited[x-2][y+1]==0){
                    visitedupdate4[x-2][y+1]=1;
                    path4.add("UR");
                    if(answer.size()==0 || (path4.size()<answer.size())){
                    findpath(x-2,y+1,visitedupdate4,n,vx,vy,path4);}
                }
            }
			
		}
		
		if(y<n-2){
			if(visited[x][y+2]==0){
                    visitedupdate5[x][y+2]=1;
                    path5.add("R");
                    if(answer.size()==0 || (path5.size()<answer.size())){
                    findpath(x,y+2,visitedupdate5,n,vx,vy,path5);}
            }
		}
		
		if(y>1){
			if(visited[x][y-2]==0){
                    visitedupdate6[x][y-2]=1;
                    path6.add("L");
                    if(answer.size()==0 || (path6.size()<answer.size())){
                    findpath(x,y-2,visitedupdate6,n,vx,vy,path6);}
            }
			
		
		}
		
	}
    }
}