#include<bits/stdc++.h>
using namespace std;
class gh{
public:
  bool visited;
  int level;
};
void foo(gh arr[][300],int a,int b,int c,int d,int n)
{
  queue<pair<int,int> > qu;
  qu.push(pair<int,int>(c,d));
  arr[c][d].level=0;
  arr[c][d].visited=1;
  while(qu.size()!=0)
  {
     pair<int,int> p=qu.front();
     if(p.second-2>=0 && arr[p.first][p.second-2].visited!=1)
     {
        arr[p.first][p.second-2].level=arr[p.first][p.second].level+1;
        qu.push(pair<int,int>(p.first,p.second-2));
        arr[p.first][p.second-2].visited=1;
     }
     if(p.second+2<n && arr[p.first][p.second+2].visited!=1)
     {
        arr[p.first][p.second+2].level=arr[p.first][p.second].level+1;
        qu.push(pair<int,int>(p.first,p.second+2));
        arr[p.first][p.second+2].visited=1;
     }
     if(p.first+2<n && p.second-1>=0 &&   arr[p.first+2][p.second-1].visited!=1)
     {
        arr[p.first+2][p.second-1].level=arr[p.first][p.second].level+1;
        qu.push(pair<int,int>(p.first+2,p.second-1));
        arr[p.first+2][p.second-1].visited=1;
     }
     if(p.first+2<n && p.second+1<n && arr[p.first+2][p.second+1].visited!=1)
     {
        arr[p.first+2][p.second+1].level=arr[p.first][p.second].level+1;
        qu.push(pair<int,int>(p.first+2,p.second+1));
        arr[p.first+2][p.second+1].visited=1;
     }
     if(p.first-2>=0 && p.second-1>=0 && arr[p.first-2][p.second-1].visited!=1)
     {
        arr[p.first-2][p.second-1].level=arr[p.first][p.second].level+1;
        qu.push(pair<int,int>(p.first-2,p.second-1));
        arr[p.first-2][p.second-1].visited=1;
     }
     if(p.first-2>=0 && p.second+1<n && arr[p.first-2][p.second+1].visited!=1)
     {
        arr[p.first-2][p.second+1].level=arr[p.first][p.second].level+1;
        qu.push(pair<int,int>(p.first-2,p.second+1));
        arr[p.first-2][p.second+1].visited=1;
     }
     qu.pop();

  }

}
int main()
{
  int n;
  cin>>n;
  int a,b,c,d;
  cin>>a>>b>>c>>d;
  gh arr[n][300];
  for (int i = 0; i < n; ++i)
  {
    for (int j = 0; j < n; ++j)
    {
      arr[i][j].visited=0;
    }
  }
  foo(arr,a,b,c,d,n);
  if(arr[a][b].visited==0)
  {
    cout<<"Impossible";
  }
  else
  {   
      cout<<arr[a][b].level<<endl;
      vector<string> whack;
      while(a!=c || b!=d)
      {
        if(a-2>=0 && b-1>=0 && arr[a-2][b-1].level < arr[a][b].level)
        {
          whack.push_back("UL");
          a=a-2;
          b=b-1;
          continue;
        }

        if(a-2>=0 && b+1<n && arr[a-2][b+1].level < arr[a][b].level)
        {
          whack.push_back("UR");
          a=a-2;
          b=b+1;
          continue;
        }
        if(b+2<n && arr[a][b+2].level < arr[a][b].level)
        {
          whack.push_back("R");
          
          b=b+2;
          continue;
        }
        if(a+2<n && b+1<n && arr[a+2][b+1].level < arr[a][b].level)
        {
          whack.push_back("LR");
          a=a+2;
          b=b+1;
          continue;
        }
        if(a+2<n && b-1>=0 && arr[a+2][b-1].level < arr[a][b].level)
        {
          whack.push_back("LL");
          a=a+2;
          b=b-1;
          continue;
        }
        if(b-2>=0 && arr[a][b-2].level < arr[a][b].level)
        {
          whack.push_back("L");
          
          b=b-2;
          continue;
        }
      }
      for (int i = 0; i < whack.size(); ++i)
      {
        cout<<whack[i]<<" ";
      }
  }
  return 0;
}