#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lp(i,a,n) for(int i=a;i<=n;++i)
#define lpd(i,a,n) for(int i=a;i>=n;--i)
#define mem(a,b) memset(a,b,sizeof a)
#define all(v) v.begin(),v.end()
#define println(a) cout <<(a) <<endl
#define sz(x) ((int)(x).size())
#define readi(x) scanf("%d",&x)
#define read2i(x,y) scanf("%d%d",&x,&y)
#define read3i(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define mod 1000000007
#define eps 1e-8
#define infi 1000000000
#define infll 1000000000000000000ll
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef set<int> si;
typedef map<int,int> mii;

const int N = 100002;
string arr[] = {"UL","UR","R","LR","LL","L"};
int dirI[] = {-2,-2,0,2, 2, 0}, dirJ[] = {-1, 1,2,1,-1,-2};

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int N = n*n;
    vector <bool> vis(N,false);
    vi parent(N,-1);
    vi print(N,-1);
    vis[i_start * n + j_start] = true;
    queue <pii> pq;
    pq.push(mp(0,i_start * n + j_start));
    while(sz(pq)) {
        pii curr = pq.front();
        pq.pop();
        int currJ = curr.second % n;
        int currI = (curr.second-currJ)/n;
        lp(i,0,5) {
            int nextI = currI + dirI[i], nextJ = currJ + dirJ[i];
            int nextNode = nextI*n+nextJ;
            if( nextI >= 0 and nextI < n and nextJ >= 0 and nextJ < n and !vis[nextNode]) {
                vis[nextNode] = true;
                parent[nextNode] = curr.second;
                print[nextNode] = i;
                pq.push(make_pair(curr.first+1,nextNode));
            }
        }
    }

    int last = i_end * n + j_end;
    if(parent[last] == -1)
        cout<<"Impossible";
    else {
        vi temp;
        while(parent[last] != -1) {
            temp.push_back(print[last]);
            last = parent[last];
        }
        cout<<sz(temp) <<endl;
        while(sz(temp)) {
            cout<<arr[temp.back()]<<" ";
            temp.pop_back();
        }
    }
}


int main() {
    int n;
    readi(n);
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath(n, i_start, j_start, i_end, j_end);
}

/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/