#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define pb push_back
#define fst first
#define snd second

typedef long long ll;
typedef pair<int,int> pii;
template<typename T> using min_queue=priority_queue<T,vector<T>,greater<T> >;

const ll MOD=1e9+7;

const int dx[]={-2,-2,0,2,2,0};
const int dy[]={-1,1,2,1,-1,-2};
const string moves[]={"UL","UR","R","LR","LL","L"};

int N;
int A,B,C,D;
int d[222][222];
int mv[222][222];

void dfs(int a0,int b0){
  if(a0==C && b0==D) return;
  for(int i=0;i<6;i++){
    int a=a0+dx[i],b=b0+dy[i];
    if(a<0 || b<0 || a>=N || b>=N) continue;

    if(d[a][b]>d[a0][b0]+1){
      d[a][b]=d[a0][b0]+1;
      mv[a][b]=i;
      dfs(a,b);
    }
  }
}

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

  cin>>N;

  memset(d,0x3f,sizeof d);
  cin>>A>>B>>C>>D;

  d[A][B]=0;
  dfs(A,B);

  if(d[C][D]<0x3f3f3f3f){
    vector<string> res;
    int a=C,b=D;
    while(a!=A || b!=B){
      int i=mv[a][b];
      res.pb(moves[i]);
      a-=dx[i],b-=dy[i];
    }
    cout<<res.size()<<'\n';
    for(int i=res.size()-1;i>=0;i--)
      cout<<res[i]<<" \n"[i==0];

  }else
    cout<<"Impossible\n";

  return 0;
}