#include<bits/stdc++.h>
using namespace std;
using Int = long long;
signed main(){
  int n;
  int sy,sx,gy,gx;
  cin>>n>>sy>>sx>>gy>>gx;
  vector<vector<int> > dp(n,vector<int>(n,-1));
  using P = pair<int,int>;
  queue<P> q;
  dp[gy][gx]=0;
  q.emplace(gy,gx);
  int dy[]={-2,-2,0,2,2,0};
  int dx[]={-1,1,2,1,-1,-2};
  string ds[]={"UL","UR","R","LR","LL","L"};
  auto in=[n](int y,int x){
    return 0<=y&&y<n&&0<=x&&x<n;
  };
  while(!q.empty()){
    P p=q.front();q.pop();
    int y=p.first,x=p.second;
    for(int k=0;k<6;k++){
      int ny=y+dy[k],nx=x+dx[k];
      if(!in(ny,nx)||~dp[ny][nx]) continue;
      dp[ny][nx]=dp[y][x]+1;
      q.emplace(ny,nx);
    }
  }
  if(dp[sy][sx]<0){
    cout<<"Impossible"<<endl;
    return 0;
  }
  cout<<dp[sy][sx]<<endl;
  int f=0;
  for(int y=sy,x=sx;y!=gy||x!=gx;){
    for(int k=0;k<8;k++){
      int ny=y+dy[k],nx=x+dx[k];
      if(!in(ny,nx)) continue;
      if(dp[ny][nx]!=dp[y][x]-1) continue;
      if(f++) cout<<" ";
      cout<<ds[k];
      y=ny;x=nx;
      break;
    }
  }
  cout<<endl;
  return 0;
}