#include <bits/stdc++.h>
using namespace std;
bool vis[1000][1000];
int dc[]={-1,1,2,1,-1,-2};
int dr[]={-2,-2,0,2,2,0};
string mov[]={"UL","UR","R","LR","LL","L"};
int main()
{
    int n,r1,c1,r2,c2,currentr,currentc,nxtr,nxtc;
    cin>>n>>r1>>c1>>r2>>c2;
    queue< pair<pair<int,int> ,vector<string> > >q;
    vector<string>v;
    q.push({{r1,c1},v});
    vis[r1][c1]=1;
    while(q.size())
    {
        currentr=q.front().first.first;
        currentc=q.front().first.second;
        v=q.front().second;
        q.pop();
        //cout<<"currentx = "<<currentr<<" currenty = "<<currentc<<" "<<vis[currentr][currentc]<<endl;
        vis[currentr][currentc]=1;
        if(currentr==r2&&currentc==c2)
        {
            cout<<v.size()<<endl;
            for(int i=0;i<v.size();i++)cout<<v[i]<<" ";
            return 0;
        }
        for(int i=0;i<6;i++)
        {
            nxtr=currentr+dr[i];
            nxtc=currentc+dc[i];
            if(nxtc>=0&&nxtc<n&&nxtr>=0&&nxtr<n&&!vis[nxtr][nxtc])
            {
                v.push_back(mov[i]);
                q.push({{nxtr,nxtc},v});
                v.pop_back();
            }
        }
    }
    cout<<"Impossible";
    return 0;
}