#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {vector<string> steps;
        int count=0;                                                              while(1){
            bool xchng=0;
    if(i_end <= i_start-2)
    {
        if(j_end <= j_start)
        {steps.push_back("UL");
            i_start-=2;
        j_start--;count++;}
        if(j_end >= j_start)
        { steps.push_back("UR"); j_start++; i_start-=2;count++;}
       xchng=1; 
    }
                                                                               else if(i_start==i_end)                                                       { if(j_end<= j_start-2)                                                          {j_start-=2; steps.push_back("L");count++;}
    if(j_end>= j_start+2) {j_start+=2; steps.push_back("R");count++;} 
  xchng=1; 
  }
                                                                             
  else if(i_end>= i_start+2)
  {
      if(j_end >= j_start )
      {j_start++; i_start+=2; steps.push_back("LR");count++;}
       if(j_end <= j_start )  
       {j_start--; i_start+=2; steps.push_back("LL");count++;}
      xchng=1; 
  }
    if(i_start==i_end & j_start==j_end) break;
            if(xchng==0) {cout<<"Impossible\n"; return;}
        }
cout<<count<<endl;
  if(count!=0){
      for(int i=0;i<steps.size();i++) cout<<steps[i]<<" ";
  }                                                                             
}

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