#include <bits/stdc++.h>
#include <queue>
using namespace std;
bool isValid(int i,int j, int n,vector<vector<pair<pair<int,int>,string>>> grid){
    if(i>=0 && i<n && j>=0 && j<n && grid[i][j].first.first==-1 )
        return true;
    else
        return false;
}

vector<pair<pair<int,int>,string>> getmoves(pair<int,int> p, int n,vector<vector<pair<pair<int,int>,string>>> grid){
    int i= p.first;
    int j= p.second;
    vector<pair<pair<int,int>,string>> moves(0);
    if(isValid(i-2, j-1,n,grid))
        moves.push_back(make_pair(make_pair(i-2, j-1),"UL"));
    if(isValid(i-2, j+1,n,grid))
        moves.push_back(make_pair(make_pair(i-2, j+1),"UR"));
    if(isValid(i, j+2,n,grid))
        moves.push_back(make_pair(make_pair(i, j+2),"R"));
    if(isValid(i+2, j+1,n,grid))
        moves.push_back(make_pair(make_pair(i+2, j+1),"LR"));
    if(isValid(i+2, j-1,n,grid))
        moves.push_back(make_pair(make_pair(i+2, j-1),"LL"));
    if(isValid(i, j-2,n,grid))
        moves.push_back(make_pair(make_pair(i, j-2),"L"));
    return moves;
}



void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    //  Print the distance along with the sequence of moves.
    vector<vector<pair<pair<int,int>,string>>> grid(n,vector<pair<pair<int,int>,string>>(n));
    queue<pair<pair<int,int>,string>> moves;
    for(int ii=0; ii<n; ii++)
    {
        for(int jj=0; jj<n; jj++)
        {
            grid[ii][jj]=make_pair(make_pair(-1, -1),"Nothing");
        }
    }
    moves.push(make_pair(make_pair(i_start,j_start),"S"));
    pair<pair<int,int>,string> b= make_pair(make_pair(-2,-2),"End");
            grid[i_start][j_start]=b;
    int i=1;
    int k=0;
    int level=0;
    while(!moves.empty())
    {
        pair<pair<int,int>,string> p= moves.front();
        moves.pop();
        //cout<<p.second<<" ";
        if(p.first.first==i_end && p.first.second==j_end)
        {
            
            int l1= i_end;
            int l2= j_end;
            string ss= "";
            
            stack<string> steps;
            //steps.push(ss);
             
            //cout<< l1 <<"-"<<l2<<" ";
            while(true)
            {
                if(l1==i_start && l2== j_start)
                    break;
                 ss= grid[l1][l2].second;
                 int q= grid[l1][l2].first.first;
                 l2= grid[l1][l2].first.second;
                 l1= q;
                 
                 steps.push(ss);
                //cout<< l1 <<"-"<<l2<<" ";
            }
            cout<< level <<endl;
            while(!steps.empty())
            {
                cout<< steps.top()<<" ";
                steps.pop();
            }
            return;
        }
        i--;
        vector<pair<pair<int,int>,string>> m= getmoves(p.first, n,grid);
        for(auto pp:m)
        {
            //if(p.first==i_end && p.second==j_end)
            moves.push(pp);
            //pp.first.first=p.first.first;
           // cout<<p.first.first<<"-"<<p.first.second<<" ";
            pair<pair<int,int>,string> b= make_pair(make_pair(p.first.first,p.first.second),pp.second);
            grid[pp.first.first][pp.first.second]=b;
            k++;
        }
        if(i==0)
        {
           // cout<<endl;
            i=k;
            k=0;
            level++;
        }
    }
    cout<<"Impossible"<<endl;
    
}

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