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.
		class Pair
		{
			int x,y;
			Pair prev,next;
			String move="";
			public Pair(int x, int y, Pair prev, String move)
			{
				this.x=x;
				this.y=y;
				this.prev=prev;
				this.move=move;
			}
		}
		Queue <Pair> points = new LinkedList<>();
		boolean [][] col = new boolean [220][220];
		Pair sol = null;
		for(int i=0; i<220; i++)	
			for(int j=0; j<220; j++)
				if(i>9&i<n+10&j>9&j<n+10)	col[i][j]=true;
		points.add(new Pair(i_start, j_start, null, ""));
		
		while(!points.isEmpty())
		{
			Pair p = points.remove();
			if(p.x==i_end&p.y==j_end)
			{
				sol=p;
				break;
			}
			if(col[p.x-2][p.y-1])	
			{
				points.add(new Pair(p.x-2,p.y-1,p,"UL "));
				col[p.x-2][p.y-1]=false;
			}
			if(col[p.x-2][p.y+1])	
			{
				points.add(new Pair(p.x-2,p.y+1,p,"UR "));
				col[p.x-2][p.y+1]=false;
			}
			if(col[p.x][p.y+2])	
			{
				points.add(new Pair(p.x,p.y+2,p,"R "));
				col[p.x][p.y+2]=false;
			}
			if(col[p.x+2][p.y+1])	
			{
				points.add(new Pair(p.x+2,p.y+1,p,"LR "));
				col[p.x+2][p.y+1]=false;
			}
			if(col[p.x+2][p.y-1])	
			{
				points.add(new Pair(p.x+2,p.y-1,p,"LL "));
				col[p.x+2][p.y-1]=false;
			}
			if(col[p.x][p.y-2])	
			{
				points.add(new Pair(p.x,p.y-2,p,"L "));
				col[p.x][p.y-2]=false;
			}
		}
		if(sol!=null)	
		{
			int cnt=0;
			while(sol.prev!=null)
			{
				sol.prev.next=sol;
				sol=sol.prev;
				cnt++;
			}
			System.out.println(cnt);
			while(sol!=null)
			{
				System.out.print(sol.move);
				sol=sol.next;
			}
		}
		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();
		i_start+=10;
		i_end+=10;
		j_start+=10;
		j_end+=10;
		printShortestPath(n, i_start, j_start, i_end, j_end);
		in.close();
	}
}