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 x, int y, int xe, int ye) {
        //  Print the distance along with the sequence of moves.
        int xt=x,yt=y;
        if(Math.abs(x-xe)%2!=0){
            System.out.println("Impossible");
            return;
        }
        int r1 = Math.abs(x-xe),r2 = Math.abs(y-ye),w = (r1/2)%2;
        if(w==0 && r2%2!=0){
            System.out.println("Impossible");
            return;
        }
        if(w==1 && r2%2==0){
            System.out.println("Impossible");
            return;
        }  
        HashMap<String,Integer> map = new HashMap<String,Integer>();
        map.put("UL",0);map.put("UR",0);map.put("R",0);map.put("LR",0);map.put("LL",0);map.put("L",0);
        int d1=0,d2=0;
        int mark[][] = new int[n][n];
        int total = 0;
        while(x!=xe || y!=ye){
            //System.out.println("x = "+x+" y="+y);
            if(x<0 || x>=n || y<0 ||y>=n || mark[x][y]==1){
                System.out.println("Impossible");
                return;
            }
            mark[x][y]=1;
            d1=x-xe;d2=y-ye;
            if(d1>0){
                if(d2>=0 && (y-1)>=0){
                    map.put("UL",map.get("UL")+1);
                    x-=2;y-=1;
                }else{
                    map.put("UR",map.get("UR")+1);
                    x-=2;y+=1;
                }
            }else if(d1<0){
                if(d2<=0 && (y+1)<n){
                    map.put("LR",map.get("LR")+1);
                    x+=2;y+=1;
                }else{
                    map.put("LL",map.get("LL")+1);
                    x+=2;y-=1;
                }
            }else{
                if(d2<=0 && (y+2)<n){
                    map.put("R",map.get("R")+1);
                    y+=2;
                }else{
                    map.put("L",map.get("L")+1);
                    y-=2;
                }
            }
            total++;
        }
        System.out.println(total);
        boolean isOk = true;
        while(isOk){
            isOk = false;
            if(map.get("UL")!=0 && (xt-2)>=0 && (yt-1)>=0){
                isOk = true;
                xt-=2;yt-=1;
                map.put("UL",map.get("UL")-1);
                System.out.print("UL ");
            }else if(map.get("UR")!=0 && (xt-2)>=0 && (yt+1)<n){
                isOk = true;
                xt-=2;yt+=1;
                map.put("UR",map.get("UR")-1);
                System.out.print("UR ");
            }else if(map.get("R")!=0 && (yt+2)<n){
                isOk = true;
                yt+=2;
                map.put("R",map.get("R")-1);
                System.out.print("R ");
            }else if(map.get("LR")!=0 && (xt+2)<n && (yt+1)<n){
                isOk = true;
                xt+=2;yt+=1;
                map.put("LR",map.get("LR")-1);
                System.out.print("LR ");
            }else if(map.get("LL")!=0 &&(xt+2)<n && (yt-1)>=0){
                isOk = true;
                xt+=2;yt-=1;
                map.put("LL",map.get("LL")-1);
                System.out.print("LL ");
            }else if(map.get("L")!=0){
                isOk = true;
                yt-=2;
                map.put("L",map.get("L")-1);
                System.out.print("L ");
            }
        }
    }

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