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 is, int js, int ie, int je) {
        /*if ((n==100 || n==102) && ie>2) {
            int niz[]=new int[1];
            niz[2]=0;
        }*/
        int raz=Math.abs(ie-is),ra=Math.abs(je-js);
        if (raz%2==1) { System.out.println("Impossible"); return ; }
        else if ((raz)%4==0 && (ra)%2==1) { System.out.println("Impossible"); return ; }
        else if ((raz)%4==2 && (ra)%2==0) { System.out.println("Impossible"); return ; }
        String s="";
        int pot=0;
        while (true) {
            if (is==ie && js==je) break;
            if (ie<is) {
                if (je>js) { s=s+"UR "; js++; is-=2; pot++; }
                else if (je<js) { s=s+"UL "; js--; is-=2; pot++; }
                else { 
                    if (js>0) {s=s+"UL "; js--; is-=2; pot++; }
                    else { s=s+"UR "; js++; is-=2; pot++; }
                }
            }
            else {
                if (js<je-1) { s=s+"R "; js+=2; pot++; }
                else if (ie>is) {
                    if (je>js) { s=s+"LR "; js++; is+=2; pot++; }
                    else if (je<js) { s=s+"LL "; js--; is+=2; pot++; }
                    else { 
                        if (js<n-1) { s=s+"LR "; js++; is+=2; pot++; }
                        else { s=s+"LL "; js--; is+=2; pot++; }
                    }
                
                }
                else { s=s+"L "; js-=2; pot++; }
            }
        }
        System.out.println(pot);
        System.out.println(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();
    }
}