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 y1, int x1, int y2, int x2) {
        //  Print the distance along with the sequence of moves.
        if((y2-y1)%2 !=0 || y1<0 || x1<0 || y2<0 || x2<0 || y1>=n || x1>=n || y2>=n || x2>=n){
            System.out.print("Impossible");
            return;   
        }
        
        else{
            ArrayList<String> actions = new ArrayList<String>();
            int steps = 0;
            while(y1!=y2){
                if(y1>y2){
                    if(x1<=x2 && x1+1<n){
                        actions.add("UR");
                        y1 = y1-2;
                        x1 = x1+1;
                        steps++;
                    }
                    else if(x1>=x2){
                        actions.add("UL");
                        y1 = y1-2;
                        x1 = x1-1;
                        steps++;
                    }
                }
                else if(y1<y2){
                    if(x1<=x2 && x1+1<n){
                        actions.add("LR");
                        y1 = y1+2;
                        x1 = x1+1;
                        steps++;
                    }
                    else if(x1>=x2){
                        actions.add("LL");
                        y1 = y1+2;
                        x1 = x1-1;
                        steps++;
                    }                    
                }
            }
            
            if(y1 == y2){
                if((x1-x2)%2 !=0){
                    System.out.print("Impossible");
                    return;
                }
                else{
                    while(x1!=x2){
                        if(x1<x2){
                             actions.add("R");
                             x1 = x1+2;
                             steps++;
                        }
                        if(x1>x2){
                             actions.add("L");
                             x1 = x1-2;
                             steps++;
                        }
                    }
                    if(x1 == x2){
                        System.out.println(steps);
                        for(int i =0; i<actions.size();i++){
                            System.out.print(actions.get(i) + " ");
                        }
                        return;
                    }
                }
            }
        }
        return;
    }
        

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