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 y1, int x1, int y2, int x2) {
        //  Print the distance along with the sequence of moves.

        int moves = 0;
        List<String> m = new ArrayList<>();
        int deltaY = Math.abs(y1 - y2);
        int deltaX = Math.abs(x1 - x2);
        
        if(deltaX % 2 != 0) {
            if((deltaY + 2) % 4 != 0) {
                System.out.println("Impossible");
                return;
            }
        } else if(deltaY % 4 != 0) {
            System.out.println("Impossible");
            return;
        }
        while(y1 != y2 || x1 != x2) {
            if(y1 == y2) {
                if(x1 < x2) {
                    m.add("R");
                    x1 += 2;
                } else {
                    m.add("L");
                    x1 -= 2;
                }
                
            }else if(x1 == x2) {
               
                    if(y1 < y2) {
                        if(x1 + 1 < n) {
                            int dy = (y2 - y1) / 4;
                            while(x1 + 1 < n && dy > 0) {
                                x1 += 1;
                                y1 += 2;
                                m.add("LR");
                                dy--;
                            }

                        } else if(x1 - 1 >= 0) {
                            m.add("LL");
                            m.add("LR");
                            y1 += 4;

                        } else {
                            
                            System.out.println("Impossible");
                            return;
                        }

                    } else if(y1 > y2) {
                        if(x1 - 1 >= 0) {
                            int dy = (y1 - y2) / 4;
                            while(x1 - 1 >= 1 && dy > 0) {
                                x1 -= 1;
                                y1 -= 2;
                                m.add("UL");
                                dy--;
                            }
                            
                            
                            
                        } else if(x1 + 1 < n){
                            m.add("UR");
                            m.add("UL");
                            y1 -= 4;
                        } else {
                            System.out.println("Impossible");
                            return;
                        }
                        
                    }

                
            }else if(x1 < x2) {
                if(y1 > y2) {
                    int dy = (y1 - y2) / 2;
                    int dx = x2 - x1;
                    int d = dy - dx;
                    if(d > 0 && x1 - 1 >= 0) {
                        m.add("UL");
                        x1 -= 1;
                        y1 -= 2;
                    } else {
                        m.add("UR");
                        x1 += 1;
                        y1 -= 2;
                    }
                } else {

                    int a = y2 - y1;
                    int b = (x2 - x1) * 2;
                    if(b > a) {
                        m.add("R");
                        x1 += 2;
                    } else {
                        m.add("LR");
                        x1 += 1;
                        y1 += 2;
                    }
                    
                }    
                
            } else {
                if(y1 < y2) {
                    
                    //do as many LR
                    int dy = (y2 - y1) / 2;
                    int dx = (x1 - x2);
                    int d = dy - dx;
                    if(d > 0 && x1 + 1 < n) {
                        m.add("LR");
                        x1 +=1;
                        y1 += 2;
                    } else {
                        m.add("LL");
                        x1 -= 1;
                        y1 += 2;
                    }
                } else {
                   m.add("UL");
                    x1 -= 1;
                    y1 -= 2;
                }
            }


        }
        System.out.println(m.size());

        for(int i = 0 ; i < m.size() ; i++) {
            System.out.print(m.get(i) + " ");
        }
        System.out.println();
        
    }
    
    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();
    }
}