#include <iostream>
#include<queue>
#include<cmath>
#include<climits>
using namespace std;
string fin_path_vertex="";
int flag=0;
struct cell
{
	int x;
	int y;
	int dis;
	string path_vertex;
	cell() {}
    cell(int x, int y, int dis,string path_vertex) : x(x), y(y), dis(dis) , path_vertex(path_vertex) {}
};
int boundary_in(int x,int y,int n)
{
	if(x>=0 && x<=n-1 && y>=0 && y<=n-1)
	{
		return 1;
	}
	else
	{
		return 0;
	}
	return 0;
	
}
int main() {
	// your code goes here
	string dir;
    int n,min_moves=0;
	cin>>n;
	cell temp;
	int source_i,source_f,dest_i,dest_f;
	cin>>source_i>>source_f>>dest_i>>dest_f;
	if(source_i-dest_i>0)
    {
        dir="up";
    }
    else if(source_i-dest_i<0)
    {
        dir="down";
    }
    queue<cell>knight_queue;
	int visited[500][500]={0};
	int dx[]={-2,-2,0,+2,+2,0};
	int dy[]={-1,+1,+2,+1,-1,-2}; 
	knight_queue.push(cell(source_i,source_f,0,""));
	int l=0;
    while(!knight_queue.empty())
	{
	temp=knight_queue.front();
	//cout<<temp.x<<" "<<temp.y<<" "<<temp.dis<<" "<<temp.path_vertex<<"->";
    //visited[temp.x][temp.y]=1;
	knight_queue.pop();
	if(temp.x==dest_i && temp.y==dest_f)
	{
	cout<<temp.dis<<endl;
	cout<<temp.path_vertex<<endl;
	return 0;
	}
	for(int i=0;i<6;i++)
	{
	  int x = temp.x+dx[i];
	  int y= temp.y+dy[i];
	  if(boundary_in(x,y,n))
	  {
	        if(visited[x][y]==0)
            {
                visited[x][y]=1;
               l++;
                // cout<<l++<<" "<<x<<" "<<y<<" "<<visited[x][y]<<endl;
            if(i==0 && dir.compare("up")==0)
	        knight_queue.push(cell(x,y,temp.dis+1,temp.path_vertex+"UL "));
	        else if(i==1 && dir.compare("up")==0)
	        knight_queue.push(cell(x,y,temp.dis+1,temp.path_vertex+"UR "));
	        else if(i==2)
	        knight_queue.push(cell(x,y,temp.dis+1,temp.path_vertex+"R "));
	        else if(i==3 && dir.compare("down")==0)
	        knight_queue.push(cell(x,y,temp.dis+1,temp.path_vertex+"LR "));
	        else if(i==4 && dir.compare("down")==0)
	        knight_queue.push(cell(x,y,temp.dis+1,temp.path_vertex+"LL "));
	        else if(i==5)
	        knight_queue.push(cell(x,y,temp.dis+1,temp.path_vertex+"L "));
            }
	  }
	}
	}
    
       // cout<<l;
	cout<<"Impossible";
	return 0;
}