import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.*;

public class Solution {

    static void printShortestPath(int n, int istart, int jstart, int iend, int jend) {
        //  Print the distance along with the sequence of moves.
        int cnt=0;
        ArrayList<String> al=new ArrayList<>();
        while((istart != iend || jstart != jend) && (istart>=0 && jstart >=0 && istart <n && jstart < n))
        {
            if((iend<=(istart-2) && jend<=(jstart-1)) || (jstart == jend && istart>iend))
            {
                istart-=2;
                jstart-=1;
                al.add("UL");
                cnt++;
            }
            else if(iend<=(istart-2) && jend>=(jstart+1))
            {
                istart-=2;
                jstart+=1;
                al.add("UR");
                cnt++;
            }
            else if(jend>=jstart+2 && istart == iend)
            {
                jstart+=2;
                al.add("R");
                cnt++;
            }
            else if((iend>=(istart+2) && jend>=(jstart+1)) || (jstart == jend && istart<iend))
            {
                istart+=2;
                jstart+=1;
                al.add("LR");
                cnt++;
            }
            else if(iend>=(istart+2) && jend <=(jstart-1))
            {
                istart+=2;
                jstart-=1;
                al.add("LL");
                cnt++;
            }
            else if(istart == iend && jend<=(jstart-2))
            {
                jstart-=2;
                al.add("L");
                cnt++;
            }
            else
            {
                //System.out.println("Impossible");
                break;
            }
        }
        if(istart==iend && jstart==jend)
        {
            System.out.println(cnt);
            for(int i=0;i<al.size();i++)
        {
            System.out.print(al.get(i)+" ");
        }
        }
        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();
    }
}