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 x1, int y1, int x2, int y2) {
       int count=0;
        String a[]=new String[n];
        if(x1%2==0 && x2%2!=0){
            System.out.println("Impossible");
        }
        else if(x1%2!=0 && x2%2==0){
            System.out.println("Impossible");
        }
        else{
            for(int j=0;j<n;j++){
             if(x2<x1 && y2<=y1){
                x1=x1-2;
                y1=y1-1;
                a[count]="UL";
                count++;
            }
            else if(x2<x1 && y2>=y1){
                x1=x1-2;
                y1=y1+1;
                a[count]="UR";
                count++;
            }
            else if(x2==x1 && y2>y1){
                y1=y1+2;
                a[count]="R";
                count++;
            }
            else if(x2>x1 && y2>=y1){
                x1=x1+2;
                y1=y1+1;
                a[count]="LR";
                count++;
            }
            else if(x2>x1 && y2<y1){
                x1=x1+2;
                y1=y1-1;
                a[count]="LL";
                count++;
            }
            else if(x2==x1 && y2<y1){
                y1=y1-2;
                a[count]="L";
                count++;
            }
            else if(x2==x1 && y1==y2){
                System.out.println(count);
                for(int i=0;i<count;i++){
                    System.out.printf("%s ",a[i]);
                }
                break;
            }
            else{
                System.out.println("Impossible");
                break;
            }
        }
            if(count==n){
                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();
    }
}