#include<bits/stdc++.h>
using namespace std;
struct data
{
    int x,y;
}s,d;
int vis[203][203],val[203][203];
int dx[]={0,-2,-2,0,2,2,0};
int dy[]={0,-1,1,2,1,-1,-2};
vector<string>v;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n,i;
    cin>>n;
    cin>>s.x>>s.y>>d.x>>d.y;
    memset(vis,-1,sizeof(vis));
    queue<data>q;

    q.push(s);
    vis[s.x][s.y]=0;
    while(!q.empty())
    {
        data u=q.front();
        q.pop();
        for(i=1;i<=6;i++)
        {
            data p;
            p.x=u.x+dx[i];
            p.y=u.y+dy[i];
            if(p.x>=0&&p.x<n&&p.y>=0&&p.y<n)
            if(vis[p.x][p.y]==-1)
            {
                q.push(p);
                vis[p.x][p.y]=i;
                val[p.x][p.y]=val[u.x][u.y]+1;
            }
        }
    }
    string str[]={"","UL", "UR", "R", "LR", "LL", "L"};
    if(vis[d.x][d.y]==-1)
    {
        cout<<"Impossible"<<endl;
    }
    else
    {
        cout<<val[d.x][d.y]<<endl;
        while(vis[d.x][d.y]!=0)
        {
            v.push_back(str[vis[d.x][d.y]]);
            data p=d;
            d.x-=dx[vis[p.x][p.y]];
            d.y-=dy[vis[p.x][p.y]];
        }
        reverse(v.begin(),v.end());
        for(i=0;i<v.size();i++)
        {
            if(i!=0)cout<<" ";
            cout<<v[i];
        }
        cout<<endl;
    }
    return 0;
}