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 [][] coords = new int [n][n];
        int moves=0;
        String s="";
        if(((i_end-i_start) % 2) != 0){
            System.out.println("Impossible");
        }else{
            if(i_end>i_start){
                if(j_end>j_start){
                    while(i_end-i_start != 0){
                        s+="LR ";
                        i_start+=2;
                        j_start++;
                        moves++;
                    }
                    while(j_end-j_start != 0){
                        s+="R ";
                        j_start+=2;
                        moves++;
                    }
                }else if(j_end<j_start){
                    while(i_end-i_start != 0){
                        s+="LL ";
                        i_start+=2;
                        j_start--;
                        moves++;
                    }
                    while(j_end-j_start != 0){
                        s+="L ";
                        j_start-=2;
                        moves++;
                    }
                }
            }else{
                if(j_end>j_start){
                    while(i_start-i_end != 0){
                        s+="UR ";
                        i_start-=2;
                        j_start++;
                        moves++;
                    }
                    while(j_end-j_start != 0){
                        s+="R ";
                        j_start+=2;
                        moves++;
                    }
                }else if(j_end<j_start){
                    while(i_start-i_end != 0){
                        s+="UL ";
                        i_start-=2;
                        j_start--;
                        moves++;
                    }
                    while(j_end-j_start != 0){
                        s+="L ";
                        j_start-=2;
                        moves++;
                    }
                }
            }
            System.out.println(moves);
            System.out.print(s);
        }
    }

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