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 x1,y1,x2,y2;
        x1=i_start;
        x2=j_start;
        y1=i_end;
        y2=j_end;
        ArrayList<String> arr=new ArrayList<String>(); 
        int diff1=y1-x1;
        int diff2=y2-x2;
        //System.out.println(y1-x1);
        //System.out.println(y2-x2);
        int l=0;
        
        while(true){
          //  System.out.println(diff1);
        //System.out.println(diff2);
            if(diff1==1 && diff2==0){
                System.out.println("impossible");
                break;
            }
            else if(diff2==-1 && diff1==0){
                System.out.println("impossible");
                break;
            }
            else if(diff1==0 && diff2==0){
                break;
            }
            else if(diff1==0 && diff2==2){
                arr.add("");
                break;
            }
            else if(diff1==0 && diff2==-2){
                
                break;
            }
            else if(diff1==1 && diff2==0){
                System.out.println("impossible");
                break;
            }
            else if(diff1==-1 && diff2==0){
                System.out.println("impossible");
                break;
            }
            else if(diff1-2>=0 && diff2-1>=0 && l!=1){
                diff1=diff1-2;
                diff2=diff2-1;
                arr.add(String.valueOf(diff1));
                arr.add(String.valueOf(diff2));
                arr.add("UL");
                l=1;
                continue;
            }
            else if(diff1-2>=0 && diff2+1<=n  && l!=1){
                diff1=diff1-2;
                diff2=diff2+1;
                arr.add(String.valueOf(diff1));
                arr.add(String.valueOf(diff2));
                arr.add("UR");
                l=1;
                continue;
            }
            else if(diff1==0 && diff2-2>=0 && l!=1){
                diff1=0;
                diff2=diff2-2;
                arr.add(String.valueOf(diff1));
                arr.add(String.valueOf(diff2));
                arr.add("L");
                l=1;
                continue;
            }
            else if(diff1==0 && diff2+2<=n && l!=1){
                diff2=diff2+2;
                arr.add(String.valueOf(diff1));
                arr.add(String.valueOf(diff2));
                arr.add("R");
                l=1;
                continue;
                
            }
            else if(diff1-2>=0 && diff2+1<=n && l!=1){
                diff1=diff1-2;
                diff2=diff2+1;
                arr.add(String.valueOf(diff1));
                arr.add(String.valueOf(diff2));
                arr.add("LL");
                l=1;
                continue;
            }
            else if(diff1-2>=0 && diff2-1>=0 && l!=1){
                diff1=diff1-2;
                diff2=diff2-1;
                arr.add(String.valueOf(diff1));
                arr.add(String.valueOf(diff2));
                arr.add("LR");
                l=1;
                continue;
            }
            l=0;
        }
        System.out.println(arr);
        
    }

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