#include<iostream>
#include<vector>
#include<map>
using namespace std;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)(x).size()
#define FOREACH(it,c) for(auto it=(c).begin();it!=(c).end();++it)
typedef long long LL;
typedef vector<int> VI;
typedef vector<long long> VLL;
typedef vector<VI> VVI;

int n,i,j,i2,j2,b,e;
int pl[200][200]={},qux[40000],quy[40000];
void check(int x,int y,int z)
{
    if(x>=0 && x<n && y>=0 && y<n && pl[x][y]==0)
    {
        pl[x][y]=z;
        ++e;
        qux[e]=x;
        quy[e]=y;
    }
}
int main()
{
    cin>>n>>i>>j>>i2>>j2;
    b=e=0;
    qux[0]=i;
    quy[0]=j;
    pl[i][j]=-1;
    while(b<=e)
    {
        i=qux[b];
        j=quy[b];
        ++b;
        check(i-2,j-1,-401);
        check(i-2,j+1,-399);
        check(i,j+2,2);
        check(i+2,j+1,401);
        check(i+2,j-1,399);
        check(i,j-2,-2);
    }
    if(pl[i2][j2]==0)
        printf("Impossible");
    map<int,string> mp;
    mp[-401]="UL ";
    mp[-399]="UR ";
    mp[2]="R ";
    mp[401]="LR ";
    mp[399]="LL ";
    mp[-2]="L ";
    vector<string> t;
    while(pl[i2][j2]!=-1)
    {
        t.PB(mp[pl[i2][j2]]);
        j2-=pl[i2][j2];
    }
    cout<<t.size()<<'\n';
    for(i=t.size()-1;i>=0;--i)
        cout<<t[i];
}