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) {
        //  Print the distance along with the sequence of moves.
        boolean[][] vis=new boolean[n][n];
        int[] js=new int[]{-1, 1, 2, 1, -1, -2};
        int[] is=new int[]{-2, -2, 0, 2, 2, 0};
        
        int c=0;
        Queue<List<Integer[]>> q=new LinkedList<>();
        vis[i_start][j_start]=true;
        List<Integer[]> t=new ArrayList<>();
        t.add(new Integer[]{i_start, j_start});
        q.add(t);
        q.add(null);
        
        boolean b=false;
        while(!q.isEmpty()){
            t=q.poll();
            if(t==null){
                if(q.peek()!=null){
                    c++;
                    q.add(null);
                } 
            }else{
                int s=t.size();
                Integer[] ar=t.get(s-1);
                if(ar[0]==i_end && ar[1]==j_end){
                    b=true;
                    break;
                }
                for(int i=0; i<6; i++){
                    int ti=ar[0]+is[i], tj=ar[1]+js[i];
                    if(ti>=0 && ti<n && tj>=0 && tj<n && !vis[ti][tj]){
                        List<Integer[]> li=new ArrayList<>(t);
                        li.add(new Integer[]{ti, tj});
                        q.add(li);
                        vis[ti][tj]=true;
                    }
                }
            }
        }
        
        if(!b){
            System.out.println("Impossible");
            return ;
        }
        String[] st=new String[]{"UL", "UR", "R", "LR", "LL", "L"};
        System.out.println(c);
        for(int k=1; k<t.size(); k++){
            Integer[] ar=t.get(k);
            int i=ar[0]-t.get(k-1)[0], j=ar[1]-t.get(k-1)[1];
            
            for(int l=0; l<6; l++){
                if(i==is[l] && j==js[l]){
                    System.out.print(st[l]+" ");
                    break;
                }
            }
        }
    }

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