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, int j, int k, int l) {
        int[][] arr=new int[100][100];
        int count=0;
        String str="";
        int a,b;
       for(a=0;a<n;a++){
          for(b=0;b<n;b++){
             arr[a][b]=0;}}
         arr[i][j]=1;
         arr[k][l]=10;
        if (arr[i-2][j-1]==0)
        {
            while(arr[i-2][j-1]==0 & arr[i-2][j-1]!=10)
            arr[i-2][j-1]=1;
            count=count+1;
             str=str+"UL";}
        else if (arr[i-2][j+1]==0)
        { while(arr[i-2][j+1]==0 & arr[i-2][j+1]!=10)
            arr[i-2][j+1]=1;
            count=count+1;
           str=str+"UR";}
        else if (arr[i][j+2]==0)
        { while(arr[i][j+2]==0 & arr[i][j+2]!=10)
            arr[i][j+2]=1;
            count=count+1;
           str=str+"R";}
        else if (arr[i+2][j+1]==0)
        { while(arr[i+2][j+1]==0 & arr[i+2][j+1]!=10)
            arr[i+2][j+1]=1;
            count=count+1;
           str=str+"LR";}
        else if (arr[i+2][j-1]==0)
        { while(arr[i+2][j-1]==0 & arr[i+2][j-1]!=10)
            arr[i+2][j-1]=1;
            count=count+1;
           str=str+"LL";}
        else if (arr[i][j-1]==0)
        { while(arr[i][j-1]==0 & arr[i][j-1]!=10)
            arr[i][j-1]=1;
            count=count+1;
            str=str+"L";}
        else
        {str="Impossible";}
        System.out.println(count);
        System.out.println(str);
    }

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