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 sx, int sy, int ex, int ey, String ans, int count ) {
        //  Print the distance along with the sequence of moves.
		int xdif = Math.abs(sx-ex), ydif = Math.abs(sy-ey);
		if(ans.length()!=0)ans+=' ';
		if(xdif<=2 && ydif<=2){
			if(xdif==2 && ydif==1){
				if(sx<ex) ans+='L';
				else ans+='U';
				if(sy<ey)ans+='R';
				else ans+='L';
				count+=1;
			}
			else if(xdif==0 && ydif==2){
				if(sy<ey)ans+='R';
				else ans+='L';
				count+=1;
			}
			else{
				ans = "Impossible";
			}
			if(!ans.equals("Impossible"))System.out.println(count);
			System.out.println(ans);
			return;
		}
		if(sx<ex){
			if(sy<=ey){
				ans+="LR";count+=1;
				printShortestPath(n, sx+2, sy+1, ex, ey, ans, count);
			}
			else{
				ans+="LL";count+=1;
				printShortestPath(n, sx+2, sy-1, ex, ey, ans, count);
			}
		}
		else if(sx>ex){
			if(sy>=ey){
				ans+="UL";count+=1;
				printShortestPath(n, sx-2, sy-1, ex, ey, ans, count);
			}
			else{
				ans+="UR";count+=1;
				printShortestPath(n, sx-2, sy+1, ex, ey, ans, count);
			}
		}
		else{
			if(sy>ey){
				ans+='L';count+=1;
				printShortestPath(n, sx, sy-2, ex, ey, ans, count);
			}
			else{
				ans+='R';count+=1;
				printShortestPath(n, sx, sy+2, ex, ey, ans, count);
			}
		}
    }

    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, "", 0);
        in.close();
    }
}