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

public class Solution {
    
//UL, UR, R, LR, LL, L
    static void printShortestPath(int n, int x, int y, int a, int b) {
        Vector<String> v=new Vector<String>(1,1);
       int m=0,s=0,k=0;
        if(x%2!=a%2)
            System.out.println("Impossible");
        
        else if((Math.abs(x-a)/2)%2==0&&y%2!=b%2)
            System.out.println("Impossible");
        
        else if((Math.abs(x-a)/2)%2==1&&y%2==b%2)
            System.out.println("Impossible");
        
        else
        {
            while(true){
                //System.out.println("possible");
                int i=x,j=y;
        if(x==a&&b>y&&s!=3)
        {//System.out.println("possibleaa");
           // System.out.println(x+"     "+y);
            v.addElement(new String("R"));
            y+=2;
            m++;
            k=3;
            s=0;
        }
        else if(x==a&&b<y&&s!=6)
        {//System.out.println("possiblebb");
           // System.out.println(x+"     "+y);
            v.addElement(new String("L"));
            y-=2;
            m++;
            k=6;
            s=0;
        }
        else if(x>a&&b<=y&&s!=1)
        {//System.out.println("possiblecc");
           // System.out.println(x+"     "+y);
            v.addElement(new String("UL"));
            x-=2;
            y--;
            m++;
            k=1;
            s=0;
        }
        else if(x>a&&b>=y&&s!=2)
        {//System.out.println("possibledd");
           // System.out.println(x+"     "+y);
            v.addElement(new String("UR"));
            x-=2;
            y++;
            m++;
            k=2;
            s=0;
        }
        else if(x<a&&b>=y&&s!=4)
        {//System.out.println("possibleee");
            //System.out.println(x+"     "+y);
            v.addElement(new String("LR"));
            x+=2;
            y++;
            m++;
            k=4;
            s=0;
        }
        else if(x<a&&b<=y&&s!=5)
        {//System.out.println("possibleff");
           // System.out.println(x+"     "+y);
            v.addElement(new String("LL"));
            x+=2;
            y--;
            m++;
            k=5;
            s=0;
        }
        
        else
            break;
        
        if(x<0||y<0||x>=n||y>=n)
        {
            v.removeElementAt(m-1);
            m--; 
            x=i;
            y=j;
            s=k;
        }
            }
            Iterator itr = v.iterator();
                        System.out.println(m);

            while(itr.hasNext())
                            System.out.print(itr.next()+" ");

    }
    }

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