#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int is, int js, int ie, int je) {
    queue< pair<int,int> > mq;
    string path[n][n];
    int i,j,ct=0;
    int vis[n][n],dis[n][n];
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
            vis[i][j]=0;    
    mq.push(make_pair(is,js));
    vis[is][js]=1;
    dis[is][js]=0;
    while(!mq.empty()){
        if(mq.front()==make_pair(ie,je))
        {
            break;
        }
        i = mq.front().first;
        j = mq.front().second;
        mq.pop();
        if(i-2>=0&&j-1>=0&&!vis[i-2][j-1]){
            path[i-2][j-1]= "UL";
            vis[i-2][j-1]=1;
            dis[i-2][j-1]=dis[i][j]+1;
            mq.push(make_pair(i-2,j-1));
        }
        if(i-2>=0&&j+1<n&&!vis[i-2][j+1]){
            path[i-2][j+1]= "UR";
            vis[i-2][j+1]=1;
            dis[i-2][j+1]=dis[i][j]+1;
            mq.push(make_pair(i-2,j+1));
        }
        if(j+2<n&&!vis[i][j+2]){
            path[i][j+2]= "R";
            vis[i][j+2]=1;
            dis[i][j+2]=dis[i][j]+1;
            mq.push(make_pair(i,j+2));
        }
        if(i+2<n&&j+1<n&&!vis[i+2][j+1]){
            path[i+2][j+1]= "LR";
            vis[i+2][j+1]=1;
            dis[i+2][j+1]=dis[i][j]+1;
            mq.push(make_pair(i+2,j+1));
        }
        if(i+2<n&&j-1>=0&&!vis[i+2][j-1]){
            path[i+2][j-1]= "LL";
            vis[i+2][j-1]=1;
            dis[i+2][j-1]=dis[i][j]+1;
            mq.push(make_pair(i+2,j-1));
        }        
        
        if(j-2>=0&&!vis[i][j-2]){
            path[i][j-2]= "L";
            vis[i][j-2]=1;
            dis[i][j-2]=dis[i][j]+1;
            mq.push(make_pair(i,j-2));
        }
    }
    if(mq.empty()){
        cout<<"Impossible"<<endl;
    }
    else
    {
        stack<string > ms;
        i= ie,j=je;
        cout<<dis[ie][je]<<endl;
        while(!(i==is&&j==js)){
            ms.push(path[i][j]);
            if(path[i][j]=="UL"){
                i+=2;
                j+=1;
            }
            else if(path[i][j]=="UR"){
                i+=2;
                j-=1;
            }
            else if(path[i][j]=="L"){
                j+=2;
            }
            else if(path[i][j]=="R"){
                j-=2;
            }
            else if(path[i][j]=="LL"){
                i-=2;
                j+=1;
            }
            else if(path[i][j]=="LR"){
                i-=2;
                j-=1;
            }
        }
        while(!ms.empty()){
            cout<<ms.top()<<" ";
            ms.pop();
        }
    }
    //  Print the distance along with the sequence of moves.
}

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