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 x, int y, int a, int b) {
    ArrayList<String> output = new ArrayList<String>();
    while(x<a-1  || x>a+1 ){
        String temp = "L";
        if(x<a-1){
            x=x+2;
        }else{
            x = x-2;
            temp = "U";
        }
        if(y<=b){
            y = y+1;
            temp = temp + "R"; 
        }else{
            y = y-1;
            temp = temp + "L";
        }
        output.add(temp);
    }
        
        if(x==a && (y-b)%2==0){
            String temp = (y-b) >0 ? "L" : "R";
            for (int i = 0 ; i < (y-b)/2;i++){
                output.add(temp);
            }
                        System.out.println(output.size());
            for(int i = 0 ; i <output.size();i++){
            System.out.print(output.get(i)+" ");
        }
        }
        else{
            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();
    }
}