#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_s, int j_s, int i_e, int j_e) {
    //  Print the distance along with the sequence of moves.
    if(j_s==j_e)
    {
        cout<<"Impossible";
    }
    else
    {
        vector<string> v;
        int flg=0;
        if(j_e>j_s)
        {
          if(i_e>=i_s)
          {
              while(i_e>i_s)
              {
                  v.push_back("LR");
                  i_s+=2;
                  j_s+=1;
                  
                }
              if(i_e<i_s)
              {
                  printf("Impossible");
                  flg=1;
                }
              else
              {
                  while(j_e>j_s)
                  {
                      v.push_back("R");
                     j_s+=2;
                  }
                  if(j_e<j_s)
                {
                  printf("Impossible");
                      flg=1;
                }
                  else
                  {
                        
                  }
                }
           }
            else
            {
                 while(i_e<i_s)
              {
                  v.push_back("UR");
                  i_s-=2;
                  j_s+=1;
                  
                }
              if(i_e>i_s)
              {
                  printf("Impossible");
                  flg=1;
                }
              else
              {
                  while(j_e>j_s)
                  {
                      v.push_back("R");
                     j_s+=2;
                  }
                  if(j_e<j_s)
                {
                  printf("Impossible");
                      flg=1;
                }
                  else
                  {
                        
                  }
                }
            }
        }
        else
        {
           if(i_e>=i_s)
          {
              while(i_e>i_s)
              {
                  v.push_back("LL");
                  i_s+=2;
                  j_s-=1;
                  
                }
              if(i_e<i_s)
              {
                  printf("Impossible");
                  flg=1;
                }
              else
              {
                  while(j_e<j_s)
                  {
                      v.push_back("L");
                     j_s-=2;
                  }
                  if(j_e>j_s)
                {
                  printf("Impossible");
                      flg=1;
                }
                  else
                  {
                        
                  }
                }
           }
            else
            {
                 while(i_e<i_s)
              {
                  v.push_back("UL");
                  i_s-=2;
                  j_s-=1;
                  
                }
              if(i_e>i_s)
              {
                  printf("Impossible");
                  flg=1;
                }
              else
              {
                  while(j_e<j_s)
                  {
                      v.push_back("L");
                     j_s-=2;
                  }
                  if(j_e>j_s)
                {
                  printf("Impossible");
                      flg=1;
                }
                  else
                  {
                        
                  }
                }
            }
        }
        
        if(flg==0)
        {
            printf("%d\n",v.size());
            if((v[0]=="lr")&&(v[v.size()-1]=="r"))
            {
                for(int i=v.size()-1;i>=0;i--)
                    cout<<v[i]<<" ";
                }
            else
            {
                for(int i=0;i<v.size();i++)
                    cout<<v[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;
}