#include<bits/stdc++.h>
using namespace std;
typedef long long int uli;
pair<int,int>dir[]={
  {-2,-1},
  {-2,1},
  {0,2},
  {2,1},
  {2,-1},
  {0,-2}
};
string dirs[]={
  "UL","UR","R","LR","LL","L"
};
const int mx=222;
int d[mx][mx];
int main(){
  int n,r1,c1,r2,c2;
  cin>>n>>r1>>c1>>r2>>c2;
  queue<pair<int,int> >q;
  q.push({r2,c2});
  memset(d,-1,sizeof d);
  d[r2][c2]=0;
  while(!q.empty()){
    int r=q.front().first;
    int c=q.front().second;
    q.pop();
    for(int i=0;i<6;i++){
      int nr=r+dir[i].first;
      int nc=c+dir[i].second;
      if(0<=nr && nr<n && 0<=nc && nc<n && d[nr][nc]==-1){
        d[nr][nc]=1+d[r][c];
        q.push({nr,nc});
      }
    }
  }
  if(d[r1][c1]==-1){
    puts("Impossible");
    return 0;
  }
  cout<<d[r1][c1]<<endl;
  int r=r1,c=c1;
  while(r!=r2 || c!=c2){
    for(int i=0;i<6;i++){
      int nr=r+dir[i].first;
      int nc=c+dir[i].second;
      if(0<=nr && nr<n && 0<=nc && nc<n && d[r][c]==1+d[nr][nc]){
        r=nr,c=nc;
        cout<<dirs[i]<<" ";
        break;
      }
    }
  }
  cout<<endl;
  return 0;
}