/** source code by coolreshab **/

#include<bits/stdc++.h>
using namespace std;

#define MAX 200
#define inf 1000000000
#define mod 1000000007
#define ll long long

int dir[6][2]={{-2,-1},{-2,1},{0,2},{2,1},{2,-1},{0,-2}};
int track[MAX+5][MAX+5][2],n;
bool vis[MAX+5][MAX+5];
queue< pair<int,int> >q;
vector< pair<int,int> >ans;

void bfs(int sx,int sy,int dx,int dy)
{
    memset(track,-1,sizeof(track));
    q.push({sx,sy});
    vis[sx][sy]=true;
    int xx,yy,x,y,i;
    while(!q.empty())
    {
        x=q.front().first;
        y=q.front().second;
        q.pop();
        for(i=0;i<6;++i)
        {
            xx=x+dir[i][0];
            yy=y+dir[i][1];
            if(xx>=0 and xx<n and yy>=0 and yy<n and !vis[xx][yy])
            {
                q.push({xx,yy});
                track[xx][yy][0]=x;
                track[xx][yy][1]=y;
                vis[xx][yy]=true;
            }
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int sx,sy,dx,dy,x,y,i;
    cin>>n>>sx>>sy>>dx>>dy;
    bfs(sx,sy,dx,dy);
    while(track[dx][dy][0]!=-1)
    {
        ans.push_back({dx,dy});
        x=track[dx][dy][0];
        y=track[dx][dy][1];
        dx=x,dy=y;
    }
    if(ans.empty())
        cout<<"Impossible";
    else
    {
        ans.push_back({sx,sy});
        reverse(ans.begin(),ans.end());
        cout<<ans.size()-1<<endl;
        for(i=0;i<ans.size()-1;++i)
        {
            x=ans[i+1].first-ans[i].first;
            y=ans[i+1].second-ans[i].second;
            if(x==-2 and y==-1)
                cout<<"UL";
            else if(x==-2 and y==1)
                cout<<"UR";
            else if(x==0 and y==2)
                cout<<"R";
            else if(x==2 and y==1)
                cout<<"LR";
            else if(x==2 and y==-1)
                cout<<"LL";
            else
                cout<<"L";
            cout<<" ";
        }
    }
    return 0;
}