#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) 
{
    vector<char>result;
int i;
  for(i=0;i_start!=i_end&&j_start!=j_end;i++)
   {

     if(j_start==j_end&&(i_start-i_end)>=2)
      {
          j_start=j_start-2;
          result.push_back('L');
      }
      else if(j_start==j_end&&(i_end-i_start)>=2)
      {
          j_start=j_start+2;
          result.push_back('R');
      }
      else if(i_start>i_end&&j_start>j_end)
      {
          i_start=i_start-2;
          j_start--;
          result.push_back('UL');
      }
      else if(i_start>i_end&&j_start<j_end)
      {
          i_start=i_start-2;
          j_start++;
          result.push_back('UR');
      }
      else if(i_start<i_end&&j_start>j_end)
      {
          i_start=i_start+2;
          j_start--;
          result.push_back('LL');
      }
    else if(i_start<i_end&&j_start<j_end)
      {
          i_start=i_start+2;
          j_start++;
          result.push_back('LR');
      }
      else
          break; 
   }
if(i_start==i_end&&j_start==j_end)
    {
        cout<<i-2<<endl;
        for(i=0;i<n;i++)
        {
            cout<<result[i]<<" ";
        }
    }
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;
}