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) {
       String path[]=new String[200];
		int k=0;
		if(i_start>i_end)
		{
			if((i_start-i_end)%2==0)
			{
				int rem=(i_start-i_end)/2;
				if(j_start==j_end)
				{
					if(rem%2==0)
					{
						int i,j_start_copy=j_start;
						for(i=1;i<=rem/2;i++)
						{
							if((j_start_copy)>0)
							{
							path[k]="UL";
							k++;
							j_start_copy--;
							}
							else
							{
								break;
							}
						}
						int j;
						for(j=i;j<rem;j++)
						{
							if(j_start_copy<n-1)
							{
							path[k]="UR";
							k++;
							j_start_copy++;
							}
							else
								break;
						}
						if(j<rem)
							System.out.println("Impossible");
						else
						{
						if((j_start_copy==j_end)||Math.abs(j_start_copy-j_end)%2==0)
						{
							int l;
							if(j_start_copy<j_end)
							{
							for(l=0;l<(j_end-j_start_copy)/2;l++)
							{
								path[k]="R";
								k++;
							}
							}
							else if(j_start_copy>j_end)
							{
								for(l=0;l<(j_start_copy-j_end)/2;l++)
								{
									path[k]="L";
									k++;
								}
							}
							System.out.println(k);
							display(path,k);
						}
						
						else
						{
							System.out.println("Impossible");
						}
						}
					}
					else
					{
						System.out.println("Impossible");
					}
				}
				else if(j_start>j_end)
				{
					int i,j_start_copy=j_start;
					for(i=1;i<=rem;i++)
					{
						if(j_start_copy>0)
						{
							if(j_start_copy>j_end)
							{
							path[k]="UL";
							k++;
							j_start_copy--;
							}
							else if(j_start_copy<j_end)
							{
								break;
							}
						}
						
						else
						{
							break;
						}
					}
					int j;
					for(j=i;j<=rem;j++)
					{
						if(j_start_copy<n-1)
						{
							path[k]="UR";
							k++;
							j_start_copy++;
						}
						else
						{
							break;
						}
					}
					if(j<rem)
					{
						System.out.println("Impossible");
					}
					else
					{
						
						if((Math.abs(j_start_copy-j_end)==0)||(Math.abs(j_start_copy-j_end)%2==0))
						{
							if(j_start_copy>j_end)
							{
								for(int l=0;l<(j_start_copy-j_end)/2;l++)
								{
									path[k]="L";
									k++;
								}
							}
							else if(j_end>j_start_copy)
							{
								for(int l=0;l<(j_end-j_start_copy)/2;l++)
								{
									path[k]="R";
									k++;
								}
							}
							System.out.println(k);
							display(path,k);
						}
						else
							System.out.println("Impossible");
					}
				}
				else if(j_start<j_end)
				{
					int i,j,j_start_copy=j_start;
					for(i=0;i<rem;i++)
					{
						if(j_start_copy<n-1)
						{
							path[k]="UR";
							k++;
							j_start_copy++;
						}
						else
							break;
					}
					if(i<rem)
						System.out.println("Impossible");
					else
					{
						if((Math.abs(j_start_copy-j_end)==0)||(Math.abs(j_start_copy-j_end)%2==0))
						{
							if(j_start_copy>j_end)
							{
								for(int l=0;l<(j_start_copy-j_end)/2;l++)
								{
									path[k]="L";
									k++;
								}
							}
							else if(j_start_copy<j_end)
							{
								for(int l=0;l<(j_end-j_start_copy)/2;l++)
								{
									path[k]="R";
									k++;
								}
							}
							System.out.println(k);
							display(path,k);
						}
						else
						{
							System.out.println("Impossible");
						}
					}
				}
			}
			else
				System.out.println("Impossible");
		}
		else if(i_end>i_start)
		{
			if((i_end-i_start)%2==0)
			{
				int rem=(i_end-i_start)/2;
				if(j_start==j_end)
				{
					if(rem%2==0)
					{
						int i,j,j_start_copy=j_start;
						for(i=1;i<=rem/2;i++)
						{
							if(j_start_copy<n-1)
							{
							path[k]="LR";
							k++;
							j_start_copy++;
							}
							else
								break;
						}
						for(j=i;j<=rem;j++)
						{
							if(j_start_copy>0)
							{
								path[k]="LL";
								k++;
								j_start_copy--;
							}
							else
								break;
						}
						if(j<rem)
							System.out.println("Impossible");
						else
						{
							if((Math.abs(j_start_copy-j_end)==0)||(Math.abs(j_start_copy-j_end)%2==0))
							{
								if(j_start_copy>j_end)
								{
									for(int l=0;l<(j_start_copy-j_end)/2;l++)
									{
										path[k]="L";
										k++;
									}
								}
								else if(j_start_copy<j_end)
								{
									for(int l=0;l<(j_end-j_start_copy)/2;l++)
									{
										path[k]="R";
										k++;
									}
								}
								System.out.println(k);
								display(path,k);
							}
							else
								System.out.println("Impossible");
						}
					}
					else
						System.out.println("Impossible");
				}
				else if(j_start>j_end)
				{
					int i,j,j_start_copy=j_start;
					for(i=1;i<=rem;i++)
					{
						if(j_start_copy>j_end)
						{
						path[k]="LL";
						k++;
						j_start_copy--;
						}
						else
							break;
					}
					if(i<rem)
						System.out.println("Impossible");
					else
					{
						if((Math.abs(j_start_copy-j_end)==0)||(j_start_copy-j_end)%2==0)
						{
							for(int l=0;l<(j_start_copy-j_end)/2;l++)
							{
								path[k]="L";
								k++;
							}
							System.out.println(k);
							display(path,k);
						}
						else
							System.out.println("Impossible");
					}
				}
				else if(j_start<j_end)
				{
					int i,j,j_start_copy=j_start;
					for(i=1;i<=rem;i++)
					{
						if(j_start_copy<n-1)
						{
							path[k]="LR";
							k++;
							j_start_copy++;
						}
						else
							break;
					}
					if(i<rem)
						System.out.println("Impossible");
					else
					{
						if((j_end-j_start_copy)%2==0)
						{
							for(int l=0;l<(j_end-j_start_copy)/2;l++)
							{
								path[k]="L";
								k++;
								
							}
							System.out.println(k);
							display(path,k);
						}
						else
							System.out.println("Impossible");
					}
				}
			}
			else
				System.out.println("Impossible");
		}
		else
		{
			if(j_end>j_start)
			{
				if(j_end-j_start%2==0)
				{
					int rem=(j_end-j_start)/2;
					System.out.println(rem);
					for(int i=0;i<rem;i++)
					{
						System.out.print("R ");
					}
				}
				else
				{
					System.out.println("Impossible");
				}
			}
			else if(j_start>j_end)
			{
				if(j_start-j_end%2==0)
				{
					int rem=(j_start-j_end)/2;
					System.out.println(rem);
					for(int i=0;i<rem;i++)
					{
						System.out.print("L ");
					}
				}
				else
				{
					System.out.println("Impossible");
				}
			}
		}
		
    }
static void display(String arr[],int a)
{
	for(int i=0;i<a;i++)
	{
		System.out.print(arr[i]+" ");
	}
}

    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();
    }
}