#include <iostream>
#include <queue>
#include <stdbool.h>
using namespace std;
int dc[]={-1,1,2,1,-1,-2};
int dr[]={-2,-2,0,2,2,0};
char m[][3]={"UL","UR","R","LR","LL","L"};
 struct point
 {
     int x;int y;
 };
 int isvalid(int x,int y,int n)
 {
     if(x>=0&&x<n&&y>=0&&y<n)
      return 1;

      return 0;
 }
int main() {
	// your code goes here
	int n;
	scanf("%d",&n);
	int  visited[n][n],mx[n][n],my[n][n];
	int i,j;
	int dx,dy,sx,sy;
	std::queue<struct point>q;
//	std::std::vector<struct point> path;
	for(i=0;i<n;i++)
	 for(j=0;j<n;j++)
	  { visited[i][j]=-1;
	     mx[i][j]=my[i][j]=-1;
	  }

	scanf("%d%d%d%d",&sx,&sy,&dx,&dy);
	struct point p;
//	printf("%d %d %d %d\n",sx,sy,dx,dy);
	p.x=sx;p.y=sy;
	q.push(p);
	visited[sx][sy]=0;
while (!q.empty())
{
struct point  u = q.front();
     q.pop(); // queue: layer by layer!
for (int j = 0; j <6; j++)
{
struct point v;
v.x=dr[j]+u.x;
v.y=dc[j]+u.y;

  if (isvalid(v.x,v.y,n)&&visited[v.x][v.y]==-1)
   { //printf("%d %d %d %d\n",v.x,v.y,u.x,u.y);
   visited[v.x][v.y]=visited[u.x][u.y]+ 1;
   mx[v.x][v.y]=u.x;
   my[v.x][v.y]=u.y;


   /*if(v.x==dx&&v.y==dy)
     break;*/
   q.push(v);
   }

}
}

if(visited[dx][dy]==-1)
 printf("Impossible\n");
 else
 {   int tx,ty,c,pa=visited[dx][dy];
    c=pa;
     int path[200];
     
     printf("%d\n",visited[dx][dy]);
    while(c!=0)
     {tx=mx[dx][dy];ty=my[dx][dy];
        for(i=0;i<6;i++)
        {   //printf("%d %d\n",tx,ty);
           if(((tx-dx)==-dr[i])&&((ty-dy)==-dc[i]) )
           {    
                 path[c]=i;
            break;
           }
        }
       dy=ty;
       dx=tx;
       
        c--;
      
     }

  for(i=1;i<=pa;i++)
   printf("%s ",m[path[i]]);

 }
 /*for(i=0;i<n;i++)
  {for(j=0;j<n;j++)
   {
       printf("%d  ",visited[i][j]);

   }
   printf("\n");

}*/


	return 0;
}