#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[6]={-2,-2,0,2,2,0},dy[6]={-1,1,2,1,-1,-2};
typedef pair<int,int> P;

void Main() {
  int n;
  R n;
  queue<P> que;
  int d[n][n],c[n][n];
  mem(d);memset(c,-1,sizeof(c));
  int sx,sy,tx,ty;
  cin >> sx >> sy >> tx >> ty;
  d[sx][sy]=1;
  que.push(P(sx,sy));
  while(!que.empty()) {
    P p=que.front();que.pop();
    rep(i,6) {
      int x=p.F+dx[i],y=p.S+dy[i];
      if(!check(n,n,x,y)||d[x][y]) continue;
      d[x][y]=1;
      c[x][y]=(i+3)%6;
      que.push(P(x,y));
    }
  }
  if(!d[tx][ty]) {
    pr("Impossible");
    return;
  }
  string s[6]={"LR","LL","L","UL","UR","R"};
  vector<string> ans;
  while(P(tx,ty)!=P(sx,sy)) {
    int k=c[tx][ty];
    ans.pb(s[k]);
    tx+=dx[k];
    ty+=dy[k];
  }
  reverse(all(ans));
  pr(ans.size());
  PR(ans,ans.size());
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}