#include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define vpll vector<pair<ll,ll> >
#define mll map<ll,ll>
#define sll set<ll>
#define fo(i,n) for(i=0;i<n;i++)
#define MOD 1000000007
#define mp make_pair
#define pb push_back
using namespace std;

int vis[201][201]={0},n;

bool check(ll i,ll j)
{
    if(i<0 || i>=n || j<0 || j>=n || vis[i][j])
        return false;
    return true;
}

int main()
{
    ios::sync_with_stdio(false);

    #ifdef UJJWAL_HOME
        freopen("000.txt","r",stdin);
    #endif

    ll i,j,k,t,i1,i2,j1,j2,i11,j11;

    cin>>n>>i1>>j1>>i2>>j2;

    i11=i1,j11=j1;

    queue<pair<ll,ll> > q;

    q.push(mp(i1,j1));

    vis[i1][j1]=10;
    while(!q.empty())
    {
        i1=q.front().first;j1=q.front().second;
        q.pop();
        if(check(i1-2,j1-1))
        {
            q.push(mp(i1-2,j1-1));vis[i1-2][j1-1]=1;
        }
        if(check(i1-2,j1+1))
        {
            q.push(mp(i1-2,j1+1));vis[i1-2][j1+1]=2;
        }
        if(check(i1,j1+2))
        {
            q.push(mp(i1,j1+2));vis[i1][j1+2]=3;
        }
        if(check(i1+2,j1+1))
        {
            q.push(mp(i1+2,j1+1));vis[i1+2][j1+1]=4;
        }
        if(check(i1+2,j1-1))
        {
            q.push(mp(i1+2,j1-1));vis[i1+2][j1-1]=5;
        }
        if(check(i1,j1-2))
        {
            q.push(mp(i1,j1-2));vis[i1][j1-2]=6;
        }
    }

    if(!vis[i2][j2])
    {
        cout<<"Impossible";return 0;
    }

    string s[]={"","UL","UR","R","LR","LL","L"};
    int a1[]={0,2,2,0,-2,-2,0},a2[]={0,1,-1,-2,-1,1,2};

    i1=i11,j1=j11;
    int c;
    vector<string> ans;
    while(i2!=i1 || j2!=j1)
    {
        c=vis[i2][j2];
        ans.pb(s[c]);
        i2+=a1[c],j2+=a2[c];
    }

    cout<<ans.size()<<endl;

    while(ans.size())
    {
        cout<<ans.back()<<" ";ans.pop_back();
    }
    return 0;
}