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.
        ArrayList<String> path=new ArrayList<String>();
        String L="L",R="R",UL="UL",UR="UR",LL="LL",LR="LR";
        int i=i_start,j=j_start,target=(i_end*10)+j_end,ans=0;
        while(i<n && j<n && i>=0 && j>=0 && ans!=target){
            if(i==i_end){
                if(j>j_end){
                    j-=2;
                    path.add(L);
                    ans=(i*10)+j;
                    continue;
                }
                if(j<j_end){
                    j+=2;
                    path.add(R);
                    ans=(i*10)+j;
                    continue;
                }
            }
            if(i<i_end){
                if(j<j_end){
                    i+=2;
                    j+=1;
                    path.add(LR);
                    ans=(i*10)+j;
                    continue;
                }
                if(j>j_end){
                    i+=2;
                    j-=1;
                    path.add(LL);
                    ans=(i*10)+j;
                    continue;
                }
                if(j==j_end){
                    int temp_i=i+2;
                    int temp_j=j+1;
                    if(temp_i<n){
                        i+=4;
                        path.add(LR);
                        path.add(LL);
                        ans=(i*10)+j;
                        continue;
                    }
                    else{
                        i+=4;
                        path.add(LL);
                        path.add(LR);
                        ans=(i*10)+j;
                        continue;
                    }
                }
            }
            if(i>i_end){
                if(j<j_end){
                    i-=2;
                    j+=1;
                    path.add(UR);
                    ans=(i*10)+j;
                    continue;
                }
                if(j>j_end){
                    i-=2;
                    j-=1;
                    path.add(UL);
                    ans=(i*10)+j;
                    continue;
                }
                if(j==j_end){
                    int temp_i=i-2;
                    int temp_j=j-1;
                    if(temp_i>=0){
                        i-=4;
                        path.add(UL);
                        path.add(UR);
                        ans=(i*10)+j;
                        continue;
                    }
                    else{
                        i-=4;
                        path.add(UR);
                        path.add(UL);
                        ans=(i*10)+j;
                        continue;
                    }
                }
            }
        }
        if(ans==target){
            System.out.println(path.size());
            for(String s:path){
                System.out.print(s+" ");
            }
        }
        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();
    }
}