#include <bits/stdc++.h>

using namespace std;
struct node{
    int curr_x,curr_y;
    int moves;
    vector<int> path;
};
struct comp {
    bool operator()(struct node const & p1, struct node const & p2) {
        // return "true" if "p1" is ordered before "p2", for example:
        return p1.moves < p2.moves;
    }
};
int row[6]={-2 ,-2 , 0 , 2 , 2 , 0};
int col[6]={-1 , 1 , 2 , 1 , -1,-2};
int check(int x,int y,int n)
{
    if(x>=0 && x<n && y>=0 && y<n)
        return 1;
    else
        return 0;
}
void pr(int x)
{
    if(x==0){
        cout<<"UL ";
    }
    else if(x==1){
        cout<<"UR ";
    }
    else if(x==2){
        cout<<"R ";
    }
    else if(x==3){
        cout<<"LR ";
    }
    else if(x==4){
        cout<<"LL ";
    }
    else if(x==5){
        cout<<"L ";
    }

}
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.

    queue < struct node> pq;
    //struct node n=(struct node*)malloc(sizeof(struct node));
    //cout<<"DONE"<<endl;
    int arr[N+1][N+1];
    for(int i=0;i<=N;i++){
        for(int j=0;j<=N;j++)
            arr[i][j]=0;
    }
    struct node n;
    struct node ans;
    int minn=99999;
    n.curr_x=i_start;n.curr_y=j_start;n.moves=0;n.path.clear();
    ans.curr_x=i_start;ans.curr_y=j_start;ans.moves=0;ans.path.clear();
    pq.push(n);
    int flag=0;

    while(!pq.empty()){
        //struct node m=(struct node*)malloc(sizeof(struct node));
        struct node m;
        m=pq.front();
        if(arr[m.curr_x][m.curr_y]==1){
            pq.pop();
            continue;
        }
        arr[m.curr_x][m.curr_y]=1;
        //cout<<m.curr_x<<"   "<<m.curr_y<<"  "<<m.moves<<endl;
        //cout<<m.curr_x;
        //break;
        /*m.curr_x=pq.top().curr_x;
        m.curr_y=pq.top().curr_y;
        m.moves=pq.top().moves;
        m.path=pq.top().path;*/
        if(m.curr_x==i_end && m.curr_y==j_end){
            flag=1;
            if(m.moves<minn){
                minn=m.moves;
                ans.curr_x=m.curr_x;ans.curr_y=m.curr_y;
                ans.moves=m.moves;
                ans.path.clear();
                 for(int j=0;j<m.path.size();j++){
                    ans.path.push_back(m.path[j]);
                }
            }
        }
        for(int i=0;i<6;i++){
            //struct node knew=(struct node*)malloc(sizeof(struct node));
            struct node knew;
            knew.curr_x=m.curr_x+row[i];
            knew.curr_y=m.curr_y+col[i];
            if(check(knew.curr_x,knew.curr_y,N)){
                knew.moves=m.moves+1;
                knew.path.clear();
                for(int j=0;j<m.path.size();j++){
                    knew.path.push_back(m.path[j]);
                }
                knew.path.push_back(i);
                pq.push(knew);
            }
        }
        pq.pop();
    }
    if(!flag){
        cout<<"Impossible";
    }
    else{
        cout<<ans.moves<<endl;
        for(int i=0;i<ans.path.size();i++){
            pr(ans.path[i]);
        }
    }
    cout<<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;
}