#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define all(a) a.begin(),a.end()
#define endl '\n'
#define y1 y12312312

using namespace std;

const int inf=1e9+3;

int n,xs,ys,xf,yf;
bool norm(int x,int y)
{
    return x>=0&&x<n&&y>=0&&y<n;
}

int d[201][201],xx,yy;
int pr[201][201];
int _x[6],_y[6];
string s[6];
int l,r;
pair<int,int> q[201*201];

int main()
{

    _y[5]=-2;
    s[5]="L";

    _y[0]=-1;
    _x[0]=-2;
    s[0]="UL";

    _y[1]=1;
    _x[1]=-2;
    s[1]="UR";

    _y[2]=2;
    s[2]="R";

    _y[3]=1;
    _x[3]=2;
    s[3]="LR";

    _y[4]=-1;
    _x[4]=2;
    s[4]="LL";

    cin>>n>>xs>>ys>>xf>>yf;
    xx=xs;
    yy=ys;
    q[1]=mp(xs,ys);

    for(int i=0;i<=n;++i)
    {
        for(int j=0;j<=n;++j)
        {
            d[i][j]=inf;
        }
    }

    d[xs][ys]=0;

    l=r=1;
    while(l<=r)
    {
        xs=q[l].ff;
        ys=q[l].ss;
        l++;

        int x1,y1;
        for(int j=0;j<6;++j)
        {
            x1=xs+_x[j];
            y1=ys+_y[j];
            if(!norm(x1,y1))continue;
            if(d[x1][y1]>d[xs][ys]+1)
            {
                d[x1][y1]=d[xs][ys]+1;
                pr[x1][y1]=j;
                q[++r]=mp(x1,y1);
            }
        }
    }

    if(d[xf][yf]==inf)
    {
        cout<<"Impossible";
        return 0;
    }

    vector<int> ans;

    while(xf!=xx||yf!=yy)
    {
        ans.pb(pr[xf][yf]);
        int vg=pr[xf][yf];
        xf-=_x[vg];
        yf-=_y[vg];
    }

    reverse(all(ans));
    cout<<ans.size()<<endl;
    for(int i=0;i<ans.size();++i)
    {
        cout<<s[ans[i]]<<" ";
    }

}