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

public class Solution {
    class cell {
        int i;
        int j;
        int steps;
        String path;
        
        cell(int i,int j, int steps,String path) {
            this.i=i;
            this.j=j;
            this.steps=steps;
            this.path=path;
        }
    }

    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.
        //  i and j direction, where a knight can move
        int di[] = {-2, -2, 0, 2, 2, 0};
        int dj[] = {-1, 1, 2, 1, -1, -2};
        String[] path = {"UL ", "UR ", "R ", "LR ", "LL ", "L "};
        StringBuffer result = new StringBuffer();
        Queue<cell> q =new LinkedList<cell>();
        cell start=new cell(i_start,j_start,0,"");
        q.add(start);
        
        cell temp;
        boolean[][] visited = new boolean[n][n];
        for(int i=0;i<n;i++) {
            for(int j=0;j<n;j++) {
                visited[i][j]=false;
            }
        }
        while(!q.isEmpty()) {
            temp=q.poll();
            visited[temp.i][temp.j]=true;
            result.append(temp.path+" ");
            if(temp.i==i_end && temp.j==j_end) {
                System.out.println(temp.steps);
                System.out.println(temp.path);
                return;
            }
            int x,y;
            for (int i = 0; i < 6; i++)
            {
              x = temp.i + di[i];
              y = temp.j + dj[i];
 
             // If rechable state is not yet visited and
             // inside board, push that state into queue
             if (isSafe(x, y, n) && !visited[x][y]) {
                q.add(new cell(x, y, temp.steps + 1,temp.path+path[i]));
             }
 
            }
        }
        System.out.println("Impossible");
    }
    
    private static boolean isSafe(int i,int j,int n) {
        if(i>=0 && i<n && j>=0 && j<n)
            return true;
        return false;
    }

    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();
        Solution sol=new Solution();
        sol.printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}