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 a=i_start-i_end;int b=j_start-j_end;
        int h=0;
        String str="";
        if((Math.abs(a)%2==0)&&((Math.abs(b)-(Math.abs(a)/2))%2==0))
        {
            while((i_start!=i_end)||(j_start!=j_end))
            {
                a=i_start-i_end;b=j_start-j_end;
                if((a>0)&&(b>=0))
                {
                   i_start=i_start-2;
                    j_start=j_start-1;
                    str=str+"UL ";
                    h++;
                    
                }
                if((a>0)&&(b<0))
                {
                   i_start=i_start-2;
                    j_start=j_start+1;
                   str=str+"UR ";
                    h++;
                    
                }
                if((a==00)&&(b<0))
                {
                   
                    j_start=j_start+2;
                    str=str+"R ";;h++;
                    
                }
                if((a<0)&&(b<=0))
                {
                   i_start=i_start+2;
                    j_start=j_start+1;
                    str=str+"LR ";
                    h++;
                }
                if((a<0)&&(b>0))
                {
                   i_start=i_start+2;
                    j_start=j_start-1;
                   str=str+"LL ";
                    h++;
                }
                if((a==0)&&(b>0))
                {
                  
                    j_start=j_start-2;
                    str=str+"L ";
                    h++;
                }
            }
            System.out.println(h);
            System.out.println(str);
            
        }
        else 
        {
            System.out.println("Impossible");
        }
    }

    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();
    }
}