#include<bits/stdc++.h>
#define rep(i,start,lim) for(lld i=start;i<lim;i++)
#define repd(i,start,lim) for(lld i=start;i>=lim;i--)
#define scan(x) scanf("%lld",&x)
#define print(x) printf("%lld ",x)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define br printf("\n")
#define sz(a) lld((a).size())
#define YES printf("YES\n")
#define NO printf("NO\n")
#define all(c) (c).begin(),(c).end()
using namespace std;
#define INF         1011111111
#define LLINF       1000111000111000111LL
#define EPS         (double)1e-10
#define MOD         1000000007
#define PI          3.14159265358979323
using namespace std;
typedef long double ldb;
typedef long long lld;
lld powm(lld base,lld exp,lld mod=MOD) {lld ans=1;while(exp){if(exp&1) ans=(ans*base)%mod;exp>>=1,base=(base*base)%mod;}return ans;}
typedef vector<lld> vlld;
typedef pair<lld,lld> plld;
typedef map<lld,lld> mlld;
typedef set<lld> slld;
#define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
#define N 205
#define fre freopen("1.in","r",stdin); freopen("1.out","w",stdout);
lld vis[N][N],ans[N][N],n;
plld par[N][N];
string parstr[N][N];
lld dirx[] = {-2,-2,0,2,2,0};
lld diry[] = {-1,1,2,1,-1,-2};
string ss[] = {"UL","UR","R","LR","LL","L"}; 
bool valid(lld x,lld y) {
  return (x>=0 and y>=0 and x<n and y<n);
}
int main()
{
  //sync;
  lld sx,sy,dx,dy;
  cin>>n>>sx>>sy>>dx>>dy;
  queue<plld> q;
  q.push({sx,sy});
  vis[sx][sy]=1;
  while(!q.empty()) {
    plld curr = q.front();
    //cout<<"curr:"<<curr.f<<" "<<curr.s<<endl;
    q.pop();
    rep(i,0,6) {
      lld nx = curr.f + dirx[i];
      lld ny = curr.s + diry[i];
      if(valid(nx,ny) and !vis[nx][ny]) {
        vis[nx][ny] = 1;
        ans[nx][ny] = ans[curr.f][curr.s]+1;
        par[nx][ny] = curr;
        parstr[nx][ny] = ss[i];
        q.push({nx,ny});
      }
    }
  }
  if(!vis[dx][dy]) {
    cout<<"Impossible";
    return 0;
  }
  cout<<ans[dx][dy]<<endl;
  vector<string> ans;
  plld curr = {dx,dy}, st = {sx,sy};
  while(curr!=st) {
    ans.pb(parstr[curr.f][curr.s]);
    curr = par[curr.f][curr.s];
  }
  reverse(all(ans));
  for(auto i:ans) cout<<i<<" ";
  return 0;
}