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

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.
        //UpperLeft, UpperRight, Right, LowerRight, LowerLeft, Left
        //UL, UR, R, LR, LL, L
        
        if((i_start-i_end)%2==1){
            System.out.println("Impossible");
        }
        else{
            int di=i_end-i_start;
            int dj=j_end-j_start;  
            int count=Math.abs(di/2);
            if(Math.abs(dj)<=count){
                System.out.println(count);
            }
            else{
                System.out.println((Math.abs(dj)-count)/2+count);
            }
            while(di!=0 && dj!=0){
                if(di<0 && dj<0){
                    System.out.print("UL ");
                    di+=2;
                    dj+=1;
                }
                else if(di<0 && dj>0){
                    System.out.print("UR ");
                    di+=2;
                    dj-=1;
                }
                else if(di>0 && dj>0){
                    System.out.print("LR ");
                    di-=2;
                    dj-=1;
                }
                else if(di>0 && dj<0){
                    System.out.print("LL ");
                    di-=2;
                    dj+=1;
                }
            }
            if(di==0 && dj!=0){
                while(dj!=0){
                    if(dj>0){
                        System.out.print("R ");
                        dj-=2;
                    }
                    else if(dj<0){
                        System.out.print("L ");
                        dj+=2;
                    }
                }
            }
            else if(dj==0 && di!=0){
                while(di!=0){
                    if(di<0){
                        System.out.print("UL UR ");
                        di+=4;
                    }
                    else if(di>0){
                        System.out.print("LR LL ");
                        di-=4;
                    }
                }
            }
        }
        
    }

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