#include <bits/stdc++.h>

using namespace std;

struct TrackableNode{
    bool visit;
    string step;
    int pi;
    int pj;
};

void BFS(int n, int i_start, int j_start, int i_end, int j_end) {
    struct TrackableNode visited[n][n];
    int ans=0;
    list<int> queue;
    int i,j;
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            visited[i][j].visit=false;
            visited[i][j].step = "NA";
            visited[i][j].pi=-1;
            visited[i][j].pj=-1;
        }    
    }
    visited[i_start][j_start].visit=true;
    queue.push_back(i_start);
    queue.push_back(j_start);
    int l=queue.size();
    int n_n=0;
    int found=0;
    while(!queue.empty()){
        int ti = queue.front();
        queue.pop_front();
        int tj = queue.front();
        queue.pop_front();
        int tni,tnj;
        tni = ti-2;
        tnj = tj-1;
        if(tni>=0 && tnj>=0 && tni<n && tnj<n){
            if(!visited[tni][tnj].visit){
                n_n++;
                visited[tni][tnj].visit = true;
                visited[tni][tnj].step = "UL";
                visited[tni][tnj].pi = ti;
                visited[tni][tnj].pj = tj;
                if(tni==i_end && tnj==j_end){
                    found=1;
                    break;
                }
                queue.push_back(tni);
                queue.push_back(tnj);
            }
        }
        tni = ti-2;
        tnj = tj+1;
        if(tni>=0 && tnj>=0 && tni<n && tnj<n){
            if(!visited[tni][tnj].visit){
                n_n++;
                visited[tni][tnj].visit = true;
                visited[tni][tnj].step = "UR";
                visited[tni][tnj].pi = ti;
                visited[tni][tnj].pj = tj;
                if(tni==i_end && tnj==j_end){
                    found=1;
                    break;
                }
                queue.push_back(tni);
                queue.push_back(tnj);
            }
        }
        tni = ti;
        tnj = tj+2;
        if(tni>=0 && tnj>=0 && tni<n && tnj<n){
            if(!visited[tni][tnj].visit){
                n_n++;
                visited[tni][tnj].visit = true;
                visited[tni][tnj].step = "R";
                visited[tni][tnj].pi = ti;
                visited[tni][tnj].pj = tj;
                if(tni==i_end && tnj==j_end){
                    found=1;
                    break;
                }
                queue.push_back(tni);
                queue.push_back(tnj);
            }
        }
        tni = ti+2;
        tnj = tj+1;
        if(tni>=0 && tnj>=0 && tni<n && tnj<n){
            if(!visited[tni][tnj].visit){
                n_n++;
                visited[tni][tnj].visit = true;
                visited[tni][tnj].step = "LR";
                visited[tni][tnj].pi = ti;
                visited[tni][tnj].pj = tj;
                if(tni==i_end && tnj==j_end){
                    found=1;
                    break;
                }
                queue.push_back(tni);
                queue.push_back(tnj);
            }
        }
        tni = ti+2;
        tnj = tj-1;
        if(tni>=0 && tnj>=0 && tni<n && tnj<n){
            if(!visited[tni][tnj].visit){
                n_n++;
                visited[tni][tnj].visit = true;
                visited[tni][tnj].step = "LL";
                visited[tni][tnj].pi = ti;
                visited[tni][tnj].pj = tj;
                if(tni==i_end && tnj==j_end){
                    found=1;
                    break;
                }
                queue.push_back(tni);
                queue.push_back(tnj);
            }
        }
        tni = ti;
        tnj = tj-2;
        if(tni>=0 && tnj>=0 && tni<n && tnj<n){
            if(!visited[tni][tnj].visit){
                n_n++;
                visited[tni][tnj].visit = true;
                visited[tni][tnj].step = "L";
                visited[tni][tnj].pi = ti;
                visited[tni][tnj].pj = tj;
                if(tni==i_end && tnj==j_end){
                    found=1;
                    break;
                }
                queue.push_back(tni);
                queue.push_back(tnj);
            }
        }
        l-=2;
        if(l==0){
            l=queue.size();
            ans++;
        }
    }
    if(found==1){
        cout <<ans+1<<endl;
        i = i_end;
        j = j_end;
        stack<TrackableNode> st;
        while (i!=i_start || j!=j_start){
            //cout <<i<<" "<<j<<endl;
            st.push(visited[i][j]);
            int ii = visited[i][j].pi;
            int jj = visited[i][j].pj;
            i=ii;
            j=jj;
        }
        while (!st.empty()){
            cout <<st.top().step<<" ";
            st.pop();
        }
        /*for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                cout <<"("<<visited[i][j].pi<<","<<visited[i][j].pj<<")"<<" ";
            }
            cout <<endl;
        }*/
    }
    else
        cout <<"Impossible"<<endl;
}

int main() {
    int n;
    cin >> n;
    int i,ans=0;
    int i_start;
    int j_start;
    int i_end;
    int j_end;
    cin >> i_start >> j_start >> i_end >> j_end;
    BFS(n, i_start, j_start, i_end, j_end);
    return 0;
}