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.
        if(Math.abs(i_end-i_start)%2 != 0){
            System.out.println("Impossible");
            return;
        }
        long steps = 0;
        ArrayList<Integer> al = new ArrayList<Integer>();
        while(i_start!=i_end || j_start!=j_end){
            if(i_start==i_end && Math.abs(j_start-j_end)==1){
                System.out.println("Impossible");
                return;
            }
            //System.out.println(i_start+" "+j_start+" "+i_end+" "+j_end+" ");
            if(i_end<i_start){
                if(j_end<=j_start){
                    steps++;
                    j_start-=1;
                    i_start-=2;
                    al.add(0);
                }
                else{
                    steps++;
                    j_start+=1;
                    i_start-=2;
                    al.add(1);
                }
            }
            else if(i_end==i_start && j_end>j_start){
                steps++;
                j_start+=2;
                al.add(2);
            }
            else if(i_end>i_start){
                if(j_end>=j_start){
                    steps++;
                    j_start+=1;
                    i_start+=2;
                    al.add(3);
                }
                else{
                    steps++;
                    j_start-=1;
                    i_start+=2;
                    al.add(4);
                }
            }
            else{
                if(j_end<j_start){
                    steps++;
                    j_start-=2;
                    al.add(5);
                }
            }
        }
        System.out.println(steps);
        for(Integer k : al){
            switch(k){
                case 0:
                    System.out.print("UL ");
                    break;
                case 1:
                    System.out.print("UR ");
                    break;
                case 2:
                    System.out.print("R ");
                    break;
                case 3:
                    System.out.print("LR ");
                    break;
                case 4:
                    System.out.print("LL ");
                    break;
                case 5:
                    System.out.print("L ");
                    break;
                
            }
        }
        System.out.println();
    }

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