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) {
        int i_curr = i_start;
        int j_curr = j_start;
        int moveCount = 0;
        String moveStr = "";
        
        if (Math.abs(i_curr - i_end) % 2 != 0) {
            System.out.println("Impossible");
        } else {
        
        while (true) {
           if (i_curr == i_end)
               if (j_curr == j_end)
                   break;
            
            if (i_curr > i_end && j_curr > j_end) {
                i_curr-=2;
                j_curr-=1;
                moveCount++;
                moveStr+= "UL ";
            }
            else if (i_curr > i_end && j_curr < j_end) {
                i_curr-=2;
                j_curr+=1;
                moveCount++;
                moveStr += "UR ";
            }
            else if (i_curr == i_end && j_curr < j_end) {
                j_curr+=2;
                moveCount++;
                moveStr += "R ";
            }
            else if (i_curr < i_end && j_curr < j_end) {
                i_curr+=2;
                j_curr+=1;
                moveCount++;
                moveStr += "LR ";
            }
            else if (i_curr < i_end && j_curr > j_end) {
                i_curr+=2;
                j_curr-=1;
                moveCount++;
                moveStr += "LL ";
            }
            else if (i_curr == i_end && j_curr > j_end) {
                 j_curr-=2;
                 moveCount++;
                 moveStr+= "L ";
            }
            else if (j_curr == j_end) {
               if (i_curr < i_end) {
                   i_curr+=2;
                   j_curr+=1;
                   moveCount++;
                   moveStr += "LR ";
               } else {
                   i_curr-=2;
                   j_curr-=1;
                   moveCount++;
                   moveStr += "UL ";
               }
            }
        }
        System.out.println(moveCount + "\n" + moveStr);
        }
    }

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