#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
int c=0,m=0,i=i_start,j=j_start;
char s[200]="";

if(i_start>n-1||j_start>n-1||i_end>n-1||j_end>n-1){
cout<<"Impossible\n";
exit(0);
}


    if(abs(i_end-i_start)%2==0){
       c=abs(i_end-i_start)/2;
	   if(j_end==j_start){
	      if(c%2==0){
		 if(i_start>i_end){
		  for(int i=0;i<c/2;i++)
		      strcat(s,"UL UR ");

		  cout<<c<<"\n"<<s<<"\n";}

		 else if(i_start<i_end){
		  for(int i=0;i<c/2;i++)
		      strcat(s,"LR LL ");

		  cout<<c<<"\n"<<s<<"\n";}

		 else
		  cout<<c<<"\n";

	      }
	      else
	      cout<<"Impossible\n";
	   }

	   else if((abs(j_end-j_start)-c)%2==0){
	    for(int k=0;k<=c;k++){
	     if(i_end<i)
	     {
		if(j_end<j){
		i=i-2;  j=j-1;
		strcat(s,"UL ");
		}

		else if(j==j_end){
		if((c-k-1)%2==0){
		m=c;
		  for(int i=0;i<(c-k-1)/2;i++)
		  strcat(s,"UL UR ");
		    i=i_end; j=j_end;
		break;}

		else{
		cout<<"Impossible\n";
		exit(0);}
		}

		else{
		i=i-2;  j=j+1;
		strcat(s,"UR ");
		}
	     }

	     else if(i_end>i)
	     {
		if(j_end>j){
		i=i+2;  j=j+1;
		strcat(s,"LR ");
		}
		else if(j==j_end){
		if((c-k-1)%2==0){
		m=c;

		  for(int i=0;i<(c-k-1)/2;i++)
		  strcat(s,"LR LL ");
		    i=i_end; j=j_end;
		  break;}

		else{
		cout<<"Impossible\n";
		exit(0);}
		}

		else{
		i=i+2;  j=j-1;
		strcat(s,"LL ");
		}
	     }


	     else{
		if(j<j_end){
		m=c+(j_end-j)/2;
		for(int p=0;p<m-c;p++)
		strcat(s,"R ");
		break;
		}
		else if(j>j_end){
		m=c+(j-j_end)/2;
		for(int p=0;p<m-c;p++)
		strcat(s,"L ");
		break;
		}
		else{
		m=c;
		break;}
	     }
	   }
	   cout<<m<<"\n"<<s<<"\n";

	   }

	   else
	   cout<<"Impossible\n";
    }

    else
        cout<<"Impossible\n";

}

int main() {
    int n;
    cin >> n;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
    return 0;
}