#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

struct node{
    int i=(-1);
    int j=(-1);
    int parenti;
    int parentj;
    bool visit=false;
    string reach="NA";
};

struct index{
    int i=(-1);
    int j=(-1);
    string type="NA";
};

vector<struct index> adjacent(int n,vector<vector<struct node>>& matrix,vector<struct index>& next,int i,int j){
    vector<struct index> adj;
    struct index temp;
    if(j-1>=0 && (i-2)>=0 && !matrix[i-2][j-1].visit){
        matrix[i-2][j-1].visit=true;
        temp.i=(i-2);
        temp.j=(j-1);
        temp.type="UL";
        adj.emplace_back(temp);
        next.emplace_back(temp);
    }
    if(j+1<n && (i-2)>=0 && !matrix[i-2][j+1].visit){
        matrix[i-2][j+1].visit=true;
        temp.i=(i-2);
        temp.j=(j+1);
        temp.type="UR";
        adj.emplace_back(temp);
        next.emplace_back(temp);
    }
    if(j+2<n && !matrix[i][j+2].visit){
        matrix[i][j+2].visit=true;
        temp.i=(i);
        temp.j=(j+2);
         temp.type="R";
        adj.emplace_back(temp);
        next.emplace_back(temp);
    }
    if(j+1<n && (i+2)<n && !matrix[i+2][j+1].visit){
        matrix[i+2][j+1].visit=true;
        temp.i=(i+2);
        temp.j=(j+1);
         temp.type="LR";
        adj.emplace_back(temp);
        next.emplace_back(temp);
    }
    if(j-1>=0 && (i+2)<n && !matrix[i+2][j-1].visit){
        matrix[i+2][j-1].visit=true;
        temp.i=(i+2);
        temp.j=(j-1);
         temp.type="LL";
        adj.emplace_back(temp);
        next.emplace_back(temp);
    }
    if(j-2>=0 && !matrix[i][j-2].visit){
        matrix[i][j-2].visit=true;
        temp.i=(i);
        temp.j=(j-2);
         temp.type="L";
        adj.emplace_back(temp);
        next.emplace_back(temp);
    }

    return adj;
}
void findShortest(vector<vector<struct node>>& matrix,int n,int starti,int startj,int stopi,int stopj){
    
    matrix[starti][startj].visit=true;
    vector<struct index> frontier;
    struct index ind;
    ind.i=starti;
    ind.j=startj;
    frontier.emplace_back(ind);
    int path=0;
    while(frontier.size()>0){
        //cout<<"Bandar"<<endl;
        vector<struct index> next;
        path++;
        for(int i=0;i<frontier.size();i++){
            struct index current=frontier[i];
            vector<struct index> adj=adjacent(n,matrix,next,current.i,current.j);
            //cout<<adj.size()<<endl;
            //cout<<"Now adj"<<endl;
            for(int j=0;j<adj.size();j++){
                struct index now=adj[j];
               // cout<<now.i<<" "<<now.j<<" "<<now.type<<endl;
                matrix[now.i][now.j].parenti=current.i;
                matrix[now.i][now.j].parentj=current.j;
                matrix[now.i][now.j].reach=now.type;
                if(now.i == stopi && now.j==stopj){
                    //cout<<"the path length is "<<path<<endl;
                    return;
                }
            }
        }
        frontier=next;
    }
    return;
}

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n=0;
    cin>>n;
    int starti=0,startj=0,stopi=0,stopj=0;
    cin>>starti>>startj>>stopi>>stopj;
    vector<vector<struct node>> matrix(n);
    for(int i=0;i<n;i++){
        vector<struct node> temp(n);
        matrix[i]=temp;
    }
    findShortest(matrix,n,starti,startj,stopi,stopj);
    //cout<<"Done"<<endl;
    vector<string> ans;
    //cout<<"Check this for once "<<matrix[stopi][stopj].reach<<endl;
    //cout<<"Check this for thrice "<<matrix[stopi][stopj].parenti<<" "<<matrix[stopi][stopj].parentj<<endl;
    //cout<<"Check this for twice "<<matrix[0][2].reach<<endl;
    while(matrix[stopi][stopj].reach!="NA"){
        //cout<<stopi<<" "<<stopj<<endl;
        //cout<<"Ikk wari yaar "<<matrix[stopi][stopj].parenti<<" "<<matrix[stopi][stopj].parentj<<endl;
        ans.emplace_back(matrix[stopi][stopj].reach);
        int tempStopi=matrix[stopi][stopj].parenti;
        int tempStopj=matrix[stopi][stopj].parentj;
        //cout<<"Ye kya hai bhai "<<stopi<<" "<<stopj<<endl;
        //cout<<"Now this also once pls "<<matrix[stopi][stopj].reach<<endl;
        stopi=tempStopi;
        stopj=tempStopj;
    }
    if(ans.size()==0){
        cout<<"Impossible"<<endl;
    }
    else{
        cout<<ans.size()<<endl;
        for(int i=ans.size()-1;i>=0;i--){
            cout<<ans[i]<<" ";
        }
    }
    
    return 0;
}