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.
        int x = i_start;
        int y = j_start;
        List<String> moves = new ArrayList<String>();
        if(i_start % 2 == i_end % 2 && ((i_start%4 == i_end%4 && j_start%2 == j_end%2)||(i_start%4 != i_end%4 && j_start%2 != j_end%2))){
            while (x != i_end || y != j_end){
                if(i_end < x){
                    if(j_end <= y && y>0){
                      moves.add("UL");
                      x -= 2;
                      y -= 1;  
                    }else if(j_end >= y && y<n-1){
                      moves.add("UR");
                      x-=2;
                      y+=1;
                    } 
                }else if(i_end == x){
                    if(j_end <y){
                        moves.add("L");
                        y -=2;
                    }else if(j_end > y){
                        moves.add("R");
                        y += 2;
                    }
                }else if(i_end > x){
                    if(j_end >= y && y<n-1){
                        moves.add("LR");
                        y +=1;
                        x+=2;
                    }else if(j_end < y && y>0){
                        moves.add("LL");
                        y -= 1;
                        x+=2;
                    }
                }
            }
            System.out.println(moves.size());
            for(String s: moves){
                System.out.print(s+" ");
            }
        } else {
            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();
    }
}