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.
        int rs =i_start, cs=j_start,re=i_end,ce=j_end;
        if(rs==re)
        {int in=Math.abs(cs-ce);
            if(in%2!=0)
                System.out.println("Impossible");
            else{int x=in/2;
                 int ctr=x;
                 System.out.println(x);
                 if(cs>ce)
                 while(ctr!=0)
                 {
                     System.out.print("L ");
                     ctr--;
                 }
                 else{
                     while(ctr!=0){
                         System.out.println("R ");
                         ctr--;
                     }
                 }
                
            }
        }
        else if(re<rs)
        {int x=Math.abs(rs-re);
            if(x%2!=0)
                System.out.println("Impossible");
           
                
            }
        else{
            int x=Math.abs(rs-re);
            if(x%2!=0)
                System.out.println("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();
    }
}