#include <bits/stdc++.h>
using namespace std;
int ie,je,n;
vector<int> v,r;
vector< pair<int,int> > p;
bool c(int i,int j)
{
    if(i<0||j<0||i>=n||j>=n)
        return false;
    return true;
}
void f(int i,int j,vector< vector<bool> > &b)
{
    if(c(i-2,j-1)&&b[i-2][j-1]) b[i-2][j-1]=false,p.push_back(make_pair(i-2,j-1));
    if(c(i-2,j+1)&&b[i-2][j+1]) b[i-2][j+1]=false,p.push_back(make_pair(i-2,j+1));
    if(c(i,j+2)&&b[i][j+2]) b[i][j+2]=false,p.push_back(make_pair(i,j+2));
    if(c(i+2,j+1)&&b[i+2][j+1]) b[i+2][j+1]=false,p.push_back(make_pair(i+2,j+1));
    if(c(i+2,j-1)&&b[i+2][j-1]) b[i+2][j-1]=false,p.push_back(make_pair(i+2,j-1));
    if(c(i,j-2)&&b[i][j-2]) b[i][j-2]=false,p.push_back(make_pair(i,j-2));
}
bool f(int i,int j)
{
    if(((i-2)==ie)&&((j-1)==je)) {r.push_back(0); return true;}
    if(((i-2)==ie)&&((j+1)==je)) {r.push_back(1);return true;}
    if(((i)==ie)&&((j+2)==je)) {r.push_back(2);return true;}
    if(((i+2)==ie)&&((j+1)==je)) {r.push_back(3);return true;}
    if(((i+2)==ie)&&((j-1)==je)) {r.push_back(4);return true;}
    if(((i)==ie)&&((j-2)==je)) {r.push_back(5);return true;}
    return false;
}
int main()
{
    int  i,j,k=1;
    vector<string> s;
    cin>>n>>i>>j>>ie>>je;
    vector< vector<bool> > b(n,vector<bool>(n,true));
    p.push_back(make_pair(-1,0));v.push_back(0);
    p.push_back(make_pair(i,j));p.push_back(make_pair(-1,k));k++;
    v.push_back(2);
    s.push_back("UL"),s.push_back("UR"),s.push_back("R");
    s.push_back("LR"),s.push_back("LL"),s.push_back("L");
    for(i=1;i<p.size();i++)
    {
        if(p[i].first==-1)
        {
            if(p[i-1].first!=-1)
                p.push_back(make_pair(-1,k)),k++,v.push_back(p.size()-1);
        }
        else f(p[i].first,p[i].second,b);
        if(!b[ie][je]) i=p.size();
    }
    if(b[ie][je]) cout<<"Impossible\n";
    else
    {
        for(i=v.size()-2;i>=0;i--)
        {
            for(j=v[i];j<v[i+1];j++)
            {
                if(f(p[j].first,p[j].second)) ie=p[j].first,je=p[j].second,j=v[i+1];
            }
        }
        cout<<k-1<<endl;
        for(i=r.size()-1;i>=0;i--)
            cout<<s[r[i]]<<" ";
        cout<<endl;
    }
}