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

#define UL 0
#define UR 1
#define R 2
#define LR 3
#define LL 4
#define L 5
int min1 = INT_MAX;
vector<int>sol;
int find(int i,int j,int dei,int dej,vector<int>&p,int count,bool visited[200][200],int n)
{ 
    if(i>=n || j>=n || i<0 || j<0 || visited[i][j])
    {
        return 0;
    }
    visited[i][j]=true;
    if(i==dei && j==dej)
    {
        if(count<min1)
    {   sol = p; 
        min1 = count;
    }
     visited[i][j]=false;
        return 1;
    }
    p.push_back(0);
  int x =  find(i-2,j-1,dei,dej,p,count+1,visited,n);
    p.pop_back();
    p.push_back(1);
   int x1 = find(i-2,j+1,dei,dej,p,count+1,visited,n);
   p.pop_back();
    p.push_back(2);
   int x2  = find(i,j+2,dei,dej,p,count+1,visited,n);
    p.pop_back();
    p.push_back(3);
   int x3 = find(i+2,j+1,dei,dej,p,count+1,visited,n);
    p.pop_back();
    p.push_back(4);
   int  x4 =  find(i+2,j-1,dei,dej,p,count+1,visited,n);
    p.pop_back();
    p.push_back(5);
    int x5 = find(i,j-2,dei,dej,p,count+1,visited,n);
    p.pop_back();
    visited[i][j]=false;
    return (x|x1|x2|x3|x4|x5);
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int n;
    cin>>n;
    int i,j,dei,dej,count=0;
    bool visited[200][200] = {{false}};
    vector<int>p;
    cin>>i>>j>>dei>>dej;
    int x = find(i,j,dei,dej,p,count,visited,n);
    if(x==1)
    { cout<<min1<<endl;
        for(i=0;i<sol.size();i++)
    {
        if(sol[i]==0)
        {
            cout<<"UL"<<" ";
        }
        else if(sol[i]==1)
        {
            cout<<"UR"<<" ";
        }
         else if(sol[i]==2)
        {
            cout<<"R"<<" ";
        }
         else if(sol[i]==3)
        {
            cout<<"LR"<<" ";
        }
         else if(sol[i]==4)
        {
            cout<<"LL"<<" ";
        }
        else
        {
            cout<<"L"<<" ";
        }
    }
    }
    else
    {
        cout<<"Impossible";
    }
    return 0;
}