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) {
        if((i_start-i_end) % 2 != 0){
            System.out.println("Impossible");
            return;
        }
        if(((j_start-j_end) - ((i_start-i_end) / 2)) % 2 != 0){
            System.out.println("Impossible");
            return;
        }
        int count =0 ;
        String path = "";
        int y = i_start - i_end;
        int x = j_start - j_end;
        while(x != 0 || y != 0){
            if(x > 0){
                if(y == 0){
                    path += "L ";
                    count++;
                    x-=2;
                }
                else if(y > 0){
                    path += "UL ";
                    count++;
                    y-=2;
                    x-=1;
                }
                else if(y<0){
                    path += "LL ";
                    count++;
                    y+=2;
                    x-=1;
                }
            }
            else if(x < 0){
                if(y == 0){
                    path += "R ";
                    count++;
                    x+=2;
                }
                else if(y > 0){
                    path += "UR ";
                    count++;
                    y-=2;
                    x+=1;
                }
                else if(y<0){
                    path += "LR ";
                    y+=2;
                    count++;
                    x+=1;
                }
            }
            else if(x == 0){
                if(y == 1 || y == -1){
                    System.out.println("Impossible");
                    return;
                }
                else if(y > 0){
                    path += "UL ";
                    count++;
                    y-=2;
                    x-=1;
                }
                else if(y<0){
                    path += "LR ";
                    y+=2;
                    count++;
                    x+=1;
                }
            }
        }
        System.out.println(count);
        System.out.println(path);
        
        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();
    }
}