#include <bits/stdc++.h>

using namespace std;
#define ft first
#define sd second
#define mk make_pair
void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    pair<string,pair<int,int> > vis[n][n];
    pair<int,int> p;
    int i,j,k;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            vis[i][j]=mk("a",mk(-1,-1));
    vis[i_start][j_start]=mk("a",mk(i_start,j_start));
    if(i_start==i_end && j_start==j_end)
        cout<<"0\n";
    else
    {
        int x[6]={-2,-2,0,2,2,0},y[6]={-1,1,2,1,-1,-2};
        string s[6]={"UL","UR","R","LR","LL","L"};
        queue<pair<int,int> > q;
        q.push(mk(i_start,j_start));
        while(!q.empty())
        {
            p=q.front();
            q.pop();
            if(p.ft==i_end && p.sd==j_end)
            {
                break;
            }
            for(i=0;i<6;i++)
            {
                if(p.ft+x[i]>-1 && p.ft+x[i]<n && p.sd+y[i]<n && p.sd+y[i]>-1 && vis[p.ft+x[i]][p.sd+y[i]].sd==mk(-1,-1))
                {
                    q.push(mk(p.ft+x[i],p.sd+y[i]));
                    vis[p.ft+x[i]][p.sd+y[i]]=mk(s[i],mk(p.ft,p.sd));
                }
            }
        }
        if(q.empty())
        {
            cout<<"Impossible";
        }
        else{
        stack<string> st;
        while(vis[p.ft][p.sd].ft!="a")
        {
            st.push(vis[p.ft][p.sd].ft);
            p=vis[p.ft][p.sd].sd;
        }
        cout<<st.size()<<"\n";
        while(!st.empty())
        {
            cout<<st.top()<<" ";
            st.pop();
        }
        }
    }
    return;
}

int main() {
    int n;
    cin >> 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);
    return 0;
}