#include <bits/stdc++.h>
#define ll long long int
using namespace std;

int main()

{
    
ll n,sx,sy,ex,ey;
cin>>n;
cin>>sx>>sy>>ex>>ey;

queue<pair<pair<int,int>,pair<string,int>>>q;


int dx[]={-2,-2,0,2,2,0};
int dy[]={-1,1,2,1,-1,-2};

string s[]={"UL","UR","R","LR","LL","L"};

q.push(make_pair(make_pair(sx,sy),make_pair("",0)));


int v[201][201]={0};

v[sx][sy]=1;

int f=0,c=0;
string b;
while(!q.empty())
{
    
    int x = q.front().first.first;
    int y = q.front().first.second;
    b = q.front().second.first;
    c= q.front().second.second;
    q.pop();
    
    if(x==ex && y==ey)
    {
        f=1;
        break;
    }
    
    for(int i=0;i<6;i++)
    {
        int tx = x+dx[i];
        int ty = y+dy[i];
        
       // cout<<tx<<" "<<ty<<"\n";
        
        if(tx>=0 && tx<n && ty>=0 && ty<n && !v[tx][ty])
        {
            v[tx][ty]=1;
        q.push(make_pair(make_pair(tx,ty),make_pair(b+s[i]+" ",c+1)));
        }
    }
    
    
}

if(f==1)
{
    cout<<c<<"\n";
    cout<<b;
}
else
cout<<"Impossible";

    
    
    
    
    return 0;
}