#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int x,j,z,i;
    if(i_start<i_end&&j_start!=j_end)
    {
        x=i_end-i_start;
        x=x/2;
        j=j_end-j_start-x;
        j=j/2;
        z=x+j;
         if(z%2==0){
        cout<<z<<endl;
        for(i=0;i<x;i++)
        {
            cout<<"LR"<<" ";
        }
          for(i=0;i<j;i++)
        {
            cout<<"R"<<" ";
        }
         }
    else cout<<"Impossible";
        }
    else if(i_start>i_end&&j_start!=j_end)
    {
        x=i_start-i_end;
        x=x/2;
        j=j_start-j_end-x;
        j=j/2;
        z=x+j;
         if(z%2==0){
        cout<<z<<endl;
        for(i=0;i<x;i++)
        {
            cout<<"UL"<<" ";
        }
          for(i=0;i<j;i++)
        {
            cout<<"L"<<" ";
        }
         }
    else cout<<"Impossible";
        }
    else if(j_start==j_end)
    {
        if(i_start>i_end){
            x=i_start-i_end;
            x=x/2;
        if(x%2==0)
        {cout<<x<<endl;
            for(i=0;i<x/2;i++)
        {
            cout<<"LL"<<" ";
        }for(i=0;i<x/2;i++)
        {
            cout<<"LR"<<" ";
        }
        }
            else cout<<"Impossible";
        }
        else {
            x=i_end-i_start;
        x=x/2;
        if(x%2==0)
        {cout<<x<<endl;
            for(i=0;i<x/2;i++)
        {
            cout<<"LR"<<" ";
        }for(i=0;i<x/2;i++)
        {
            cout<<"LL"<<" ";
        }
        }
            else cout<<"Impossible";
        }
            
        }
    else if(i_start==i_end)
    {
        if(j_start>j_end){
            x=j_start-j_end;
            x=x/2;
        if(x%2==0)
        {cout<<x<<endl;
            for(i=0;i<x/2;i++)
        {
            cout<<"LL"<<" ";
        }for(i=0;i<x/2;i++)
        {
            cout<<"UR"<<" ";
        }
        }
            else cout<<"Impossible";
        }
        else {
            x=j_end-j_start;
        x=x/2;
        if(x%2==0)
        {cout<<x<<endl;
            for(i=0;i<x/2;i++)
        {
            cout<<"LR"<<" ";
        }for(i=0;i<x/2;i++)
        {
            cout<<"UL"<<" ";
        }
        }
            else cout<<"Impossible";
        }
            
        }
    }
    
   


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