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 x, int y) {
        int[] p=new int[6], q=new int[6];
        int a=0, c=0, m=0;
        String s[]={"UL", "UR", "R", "LR", "LL", "L"}, o="";
        double d[]=new double[6];
        
        while(true) {
            p[0]=p[1]=i-2;
            p[3]=p[4]=i+2;
            p[2]=p[5]=i;

            q[0]=q[4]=j-1;
            q[1]=q[3]=j+1;
            q[2]=j+2;
            q[5]=j-2;
            
            for(a=0, m=0; a<6; a++)  {
                if(x==p[a] && y==q[a])  {
                    c++;
                    System.out.println(c+"\n"+o+s[a]);
                    return;
                }
                else   {
                    d[a]=Math.sqrt((x-p[a])*(x-p[a])+(y-q[a])*(y-q[a]));
                    if(d[a]==Math.sqrt(2) || d[a]==1)   {
                        System.out.println("Impossible");
                        return;
                    }
                    if(d[m]>d[a])   m=a;
                }
                
            }
            
            o=o+s[m]+" ";
            c++;
            i=p[m];
            j=q[m];
        }
    }

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