#include <bits/stdc++.h>
#define F first 
#define S second
#define mp make_pair
using namespace std;
int n;
int i_start;
int j_start;
int i_end;
int j_end;
bool ans  =0 ;
bool mat[201][201] = {0};
queue< pair <pair<int ,int > , string > > q;
pair<int , int > p;
pair <pair<int ,int > , string > pp ;
string s;

bool validate(int i , int j)
{
    if (i >= 0 && j >= 0 && i<n && j < n)return 1;
    return 0;
}

void printShortestPath() {
    //  Print the distance along with the sequence of moves.
    p.F = i_start ;
    p.S = j_start ;
    pp.F = p;
    pp.S = s;
    q.push(pp) ;
    
    while(!q.empty() )
    {
        pp = q.front();q.pop();
        
        int i = pp.F.F , j = pp.F.S ; 
        s = pp.S;
        
        if(!validate(i , j))
        {            
            continue;
        }
        if(mat[i][j])continue ;
        mat[i][j] = 1;
      //  cout << i << " " << j << " " <<s <<endl;
        
        if(i == i_end && j == j_end)
        {
            int sz = 0;
            int ind = 0;
            while(ind < s.size())
            {
                if(s[ind] == '.')sz++;
                ind++;
            }
            cout << sz << endl;
            for(int k=0;k<s.size();k++)
            {
                if(s[k] == '.')cout << " ";
                else cout << s[k];
            }
            return ;
        }
        q.push(mp(mp(i-2 , j-1) , s + "UL." ) );
        q.push(mp(mp(i-2 , j+1) , s + "UR." ) );
        q.push(mp(mp(i , j+2) , s + "R." ) );
        q.push(mp(mp(i+2 , j+1) , s + "LR." ) );
        q.push(mp(mp(i+2 , j-1) ,s + "LL." ) );
        q.push(mp(mp(i , j-2) , s + "L." ) );
    }
    cout << "Impossible" << endl;
}

int main() {
    cin >> n;    
    cin >> i_start >> j_start >> i_end >> j_end;
    printShortestPath();
    return 0;
}