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) {
        int dx = j_end-j_start;
        int dy = i_start-i_end;
        String ris = "";
        if(Math.abs(dy)%2!=0){
            System.out.println("Impossible");
            return;
        }
        int UL=0;
        int UR=0;
        int R=0;
        int LR=0;
        int LL=0;
        int L=0;
        if((Math.abs(dy)-Math.abs(dx*2))%4!=0){
            System.out.println("Impossible");
            return;
        }
        if(dy>0){
            if(dx>0){
                if(dx >= dy/2){
                    UR = dy/2;
                    R=(dx-dy/2)/2;        
                } else {
                    UR = dx*2 + (dy-dx)/4;
                    UL = (dy-dx)/4;
                }
            } else {
                if(-dx >= dy/2){
                    UL = dy/2;    
                    L=(-dx-dy/2)/2;                            
                } else {
                    UL = -dx*2 + (dy+dx)/4;
                    UR = (dy+dx)/4;
                }
            }
        } else {
            if(dx>0){
                if(dx >= -dy/2){
                    LL = -dy/2;
                    R=(dx+dy/2)/2;        
                } else {
                    LR = dx*2 + (-dy-dx)/4;
                    LL = (-dy-dx)/4;
                }
            } else {
                if(-dx >= -dy/2){
                    LL = -dy/2;    
                    L=(-dx+dy/2)/2;                            
                } else {
                    LL = -dx*2 + (-dy+dx)/4;
                    LR = (-dy+dx)/4;
                }
            }
        }
        int x=j_start;
        int y=i_start;
        // System.out.println("UL="+UL+" UR="+UR+" R="+R+" LL="+LL+" LR="+LR+" L="+L);
        System.out.println(UL+UR+R+L+LL+LR);
        // System.out.println(y+"caca"+i_end);
        while(y>i_end){
            while(UL>0 && x>0){
                y-=2;
                x--;
                UL--;
                ris+="UL ";
            }
            if(UR>0 && x<n-1){
                y-=2;
                x++;
                dx++;
                UR--;
                ris+="UR ";
            }
            if(x==n-1 && UR==0){
                R++;
                x+=2;
                ris+="R ";
            }
            if(x==0 && UL==0){
                L--;
                x-=2;
                ris+="L ";
            }
        }
        while(R>0){
            R++;
            x+=2;
            ris+="R ";
        }
        while(y<i_end){
            while(LR>0 && x<n-1){
                y+=2;
                x++;
                LR--;
                ris+="LR ";
            }
            if(LL>0 && x>0){
                y+=2;
                x--;
                LL--;
                ris+="LL ";
            }
            if(x==0 && LL==0){
                L--;
                x-=2;
                ris+="L ";
            }
        }
        while(L>0){
            L--;
            x-=2;
            ris+="L ";
        }
        System.out.println(ris);
    }

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