// Miroslaw
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<cassert>
#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
using namespace std;

typedef long long LL;
typedef vector<int> VI;

#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define FOREACH(i,c) for(__typeof((c).begin())i = (c).begin();i!=(c).end(); ++i)

int cond = 1;
#define DB(X) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<endl;}}
#define DB2(X, Y) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<", "<<#Y<<" = "<<Y<<endl;}}
#define DB3(X, Y, W) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<", "<<#Y<<" = "<<Y<<", "<<#W<<" = "<<W<<endl;}}
#define DB4(X, Y, W, Z) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = "<<X<<", "<<#Y<<" = "<<Y<<", "<<#W<<" = "<<W<<", "<<#Z<<" = "<<Z<<endl;}}
#define DBP(X) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<" = ("<<X.first<<", "<<X.second<<")" << endl;}}
#define DBV(X) {if(cond){cerr<<"Line:"<<__LINE__<<", "<<#X<<": ";FOREACH(__i,X)cerr<<*__i<<" ";cerr<<endl;}}

static const int MAXN = 213;

int t[MAXN][MAXN];
string ans[MAXN][MAXN];

vector<vector<int>> moves{{-2, -1}, {-2, 1}, {0, 2}, {2, 1}, {2, -1}, {0, -2}};
vector<string> names =    {"UL",     "UR",   "R", "LR", "LL", "L"};

int main() {
  int n;
  scanf("%d", &n);
  int x, y, xx, yy;
  scanf("%d%d%d%d", &xx, &yy, &x, &y);
  REP(i, MAXN) REP(j, MAXN) t[i][j] = 1000000000;
  t[xx][yy] = 0;
  queue<pair<int, int>> q;
  q.push({xx, yy});
  while (!q.empty()) {
    auto wz1 = q.front(); q.pop();
    int a = wz1.first, b = wz1.second;
    for (int i = 0; i < moves.size(); ++i) {
      int nx = a + moves[i][0], ny = b + moves[i][1];
      if (nx >= 0 && nx < n && ny >= 0 && ny < n && t[nx][ny] > t[a][b] + 1) {
        t[nx][ny] = t[a][b] + 1;
        ans[nx][ny] = ans[a][b].empty() ? "" : ans[a][b] + " ";
        ans[nx][ny] += names[i];
        q.push({nx, ny});
      }
    }
  }
  if (t[x][y] != 1000000000) {
    printf("%d\n", t[x][y]);
    printf("%s\n", ans[x][y].c_str());
  } else {
    printf("Impossible\n");
  }
  return 0;
}