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

public class Solution {

   final static int[][] dir = {{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}/*L*/};
    final static String[] dirstr = {"UL","UR","R","LR","LL","L"};
    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.
        Queue<int[]> queue = new LinkedList();
        queue.offer(new int[]{i_start,j_start});
        boolean[][] visited = new boolean[n][n];
        visited[i_start][j_start] = true;
        Stack<String> pathrec = new Stack();
        int[][] path = new int[n][n];
        boolean found = false;
        while(!queue.isEmpty())
        {
            int[] top = queue.poll();
            if(top[0] == i_end &&  top[1]==j_end)
            {
                // found shortest path
                found = true;
                break;
            }
            for(int d=0;d<6;d++)
            {
                int x = top[0]+dir[d][0];
                int y = top[1]+dir[d][1];
                if(x>=0&&x<n&&y>=0&&y<n)
                {
                    if(!visited[x][y])
                    {
                        path[x][y] = d;
                        queue.offer(new int[]{x,y});
                        visited[x][y] = true;
                    }
                }
                
            }
        }
        if(found)
        {
            int i=i_end;
            int j=j_end;
            while(i!=i_start || j!=j_start)
            {
                int d = path[i][j];
                pathrec.push(dirstr[d]);
                i = i-dir[d][0];
                j = j-dir[d][1];
            }
            System.out.println(pathrec.size());
            while(!pathrec.isEmpty())
            {
                System.out.print(pathrec.pop()+" ");
            }
        }else
        {
            System.out.print("Impossible");
        }
    }

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