#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<map>
#include <bits/stdc++.h>
#include<iterator>
#define ini(n) scanf("%d", &n)
//#define ins(s) cin>>s;
#define ins(s) cin>>s
#define outi(n) printf("%d", n)
#define inlli(n) scanf("%lld", &n)
#define outlli(n) printf("%lld", n)
#define newline printf("\n");
#define newtab printf("\t");
#define outs(s) printf("%s", s)
#define outa(a, n) for(int i =0; i< n; i++) cout<<a[i]<<"\t"
#define loopi(n) for(int i =0; i< n; i++)
#define loopj(n) for(int j=0; j< n; j++)
#define loopis(start,n) for(int i =start; i< n; i++)
#define loopjs(start,n) for(int j =start; j< n; j++)
#define min(x,y) x<y?x:y
#define max(x,y) x>y?x:y
#define pi pair<int,int>
#define ppi pair<int,pi >


//usage of vector hash : unordered_set<vector<int>, VectorHash > s;
typedef long long int lli;
typedef long double ld;

using namespace std;
vector<pair<int, int> > v;
int moves[6][2]={-2, -1, -2, 1, 0, 2, 2, 1, 2, -1, 0, -2};
vector<pair<int, int> > ans;
int mat[200][200]={0};
vector<vector<int> > path;

void dfs(int i, int j, int len, int ir, int jr, int n){
//    cout<<i<<" "<<j<<endl;
    if(i == ir && j == jr){
        return;
    }
    for(int k = 0; k<6;k++){
        int in = i + moves[k][0];
        int jn = j + moves[k][1];
        if(in >= 0 && in < n && jn >= 0 && jn < n && len < mat[in][jn]){
            mat[in][jn] = len;
            path[in][jn] = k;
            dfs(in, jn, len+1, ir, jr, n);
        }
    }
}
void fun(int i, int j, int is, int js){
//    cout<<i<<" "<<j<<endl;
    if(i == is && j == js)
        return;
    int k = path[i][j];
    int p = (k+3)%6;
    fun(i+moves[p][0], j + moves[p][1], is, js);
    if( k == 0)
        cout<<"UL ";
    else if( k == 1)
        cout<<"UR ";
    else if( k == 2)
        cout<<"R ";
    else if( k == 3)
        cout<<"LR ";
    else if( k == 4)
        cout<<"LL ";
    else if( k == 5)
        cout<<"L ";
}
int main(){
    int n;
    cin>>n;
    path.resize(n, vector<int>());
    loopi(200){
        loopj(200)
            mat[i][j] = INT_MAX;
    }
    loopi(n){
        path[i].resize(n, -1);
    }
    int is, js, ie, je;
    cin>>is>>js>>ie>>je;
    if(is == js && ie == je){
        cout<<0<<endl;
        return 0;
    }
    dfs(is, js, 1, ie, je, n);
    if(mat[ie][je] == INT_MAX)
        cout<<"Impossible\n";
    else{
        cout<<mat[ie][je]<<endl;
        int i = ie, j = je;
        fun(i, j, is, js);
        cout<<endl;
    }
    return 0;
}