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 x, int y, int p, int q, int count, List<String> arr) {
        if(p == x && q == y){
            System.out.println(count);
            String paths[] = new String[arr.size()];
            arr.toArray(paths);
            for(int i=0; i<arr.size(); i++){
                System.out.print(paths[i] + " ");
            }
        }
        else if(p<x && q<y && x>=0 && y>=0){
            x = x-2;
            y = y-1;
            arr.add("UL");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else if(p<x && q>y && x>=0 && y<=n){
            x = x-2;
            y = y+1;
            arr.add("UR");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else if(p==x && q<y && x<n && y>=0){
            y = y-2;
            arr.add("L");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else if(p == x && q > y && x<n && y>=0){
            y = y+2;
            arr.add("R");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else if(p>x && q<y && x<n && y>=0){
            x = x+2;
            y = y-1;
            arr.add("LL");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else if(p>x && q>y && x<n && y<n){
            x = x+2;
            y = y+1;
            arr.add("LR");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else if(p>x && q==y && x<n && y<n){
            x = x+2;
            y = y+1;
            arr.add("LR");
            count++;
            printShortestPath(n,x,y,p,q,count,arr);
        }
        else{
            System.out.print("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();
        int count = 0;
        List<String> arr = new ArrayList<String>();
        printShortestPath(n, i_start, j_start, i_end, j_end, count, arr);
        in.close();
    }
}