// Template by [thunder_blade]
// IIIT ALLAHABAD
// includes :)

#include <bits/stdc++.h>
using namespace std;
#define TEST  int test_case; cin>>test_case; while(test_case--)
#define all(v) (v).begin(),(v).end()
#define fi  first
#define se  second
#define pb push_back
#define mp make_pair
#define ll long long int
#define SPEED ios_base::sync_with_stdio(false);  cin.tie(0);  cout.tie(0);
#define pi(x) printf("%d\n",x)
#define pl(x) printf("%lld\n",x)
#define pf(x) printf("%f\n",x)
#define ps(x) printf("%s\n",x)
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define sf(x) scanf("%f",&x)
#define ss(x) scanf("%s",x)
#define pis(x) printf("%d ",x)
#define pls(x) printf("%lld ",x)
#define pfs(x) printf("%f ",x)
#define pss(x) printf("%s ",x)
#define FOR(i,a,b) for(i=a;i<b;i++)
#define mod 1000000007

const int N = 500005;

int xcor[] = {-1,1,2,1,-1,-2};
int ycor[] = {-2,-2,0,2,2,0};

struct node{
  int x,y;
  int move;
  string dir;
};
map< pair<int,int>, pair<int,int> >ma;
map< pair<int,int>,int>ans;
int n;

int check(int x, int dx, int y, int dy)
{
  x+=dx;
  y+=dy;
  if(x>=0 && x<n && y>=0 && y<n)return 1;
  return 0;
}

string get(int idx)
{
  string arr[] = {"UL", "UR", "R", "LR", "LL", "L"};
  return arr[idx];
}

map< pair<int,int>, string>dd;

int main()
{
  si(n);

  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      ans[{i,j}] = 1e7;
    }
  }
  int sx,sy,ex,ey;
  si(sx), si(sy),si(ex),si(ey);

  swap(sx,sy);
  swap(ex,ey);

  queue< struct node >q;
  struct node st;
  st.move = 0;
  st.x = sx;
  st.y = sy;
  st.dir = "";
  q.push(st);
  ma[{sx,sy}] = {0,0};
  dd[{sx,sy}] = "finish";
  ans[{sx,sy}] = 0;

  while(!q.empty())
  {
    struct node tmp = q.front();
    q.pop();
    int x = tmp.x;
    int y = tmp.y;
    for(int i=0;i<6;i++){  
      int val = ans[{x,y}];
      struct node tt;
      if(check(x, xcor[i],y,ycor[i]) && ans[{x+xcor[i], y+ycor[i]}]>val+1){
        ans[{x+xcor[i], y+ycor[i]}] = val+1;
        ma[{x+xcor[i], y+ycor[i]}] = {x,y};
        tt.x = x+xcor[i];
        tt.y = y+ycor[i];
        tt.move = val+1;
        ans[{x+xcor[i], y+ycor[i]}] = val+1;
        dd[{x+xcor[i], y+ycor[i]}] = get(i);
        //cout<<dd[{x+xcor[i], y+ycor[i]}]<<endl;
        q.push(tt);
      }
    }
  }
  if(ans[{ex,ey}] == 1e7){
    puts("Impossible");
  }else{
    vector<string>v;
    cout<<ans[{ex,ey}]<<endl;
    while(dd[{ex,ey}]!="finish"){
      v.pb(dd[{ex,ey}]);
      //cout<<dd[{ex,ey}]<<endl;
      int eex = ex;
      int eey = ey;
      ex = ma[{eex,eey}].fi;
      ey = ma[{eex,eey}].se; 
    }
    reverse(all(v));
    for(auto i:v){
      cout<<i<<" ";
    }

  }

}