#include <bits/stdc++.h>

using namespace std;


void printPath(int size, int i_start, int j_start, int i_end, int j_end, stack<string> path)
{
    //cout<<size<<" ";
    int distance=abs(i_start-i_end)+abs(j_start-j_end);
    //cout<<distance<<"\n";
      //UL=6, UR=5, R=4, LR=3, LL=2, L=1
    if(size==0 && distance==0)
    {
        //print path
        //cout<<"here";
        stack<string> finalPath;
        while(!path.empty())
        {
            finalPath.push(path.top());
            path.pop();
        }
        while(!finalPath.empty())
        {
            cout<<finalPath.top()<<" ";
            finalPath.pop();
        }
        exit(0);
    }
    else if(size==0 && distance!=0)
    {
        //cout<<"here1";
        return;
    }
    
    else
    {
        //cout<<"here3";
        //cout<<distance<<" "<<(abs(i_start-i_end-1)+abs(j_start-j_end-2));
        if((abs(i_start-i_end-2)+abs(j_start-j_end-1))<distance)
        {
            //cout<<"here4";
            path.push("UL");
            printPath(size-1,i_start-2,j_start-1,i_end,j_end,path);
            path.pop();
        }
        if(abs(i_start-i_end-2)+abs(j_start-j_end+1)<distance)
        {
            path.push("UR");
            printPath(size-1,i_start-2,j_start+1,i_end,j_end,path);
            path.pop();
        }
        if(abs(i_start-i_end)+abs(j_start-j_end+2)<distance)
        {
            path.push("R");
            printPath(size-1,i_start,j_start+2,i_end,j_end,path);
            path.pop();
        }
        if(abs(i_start-i_end+2)+abs(j_start-j_end+1)<distance)
        {
            path.push("LR");
            printPath(size-1,i_start+2,j_start+1,i_end,j_end,path);
            path.pop();
        }
        if(abs(i_start-i_end+2)+abs(j_start-j_end-1)<distance)
        {
            path.push("LL");
            printPath(size-1,i_start+2,j_start-1,i_end,j_end,path);
            path.pop();
        }
         if(abs(i_start-i_end)+abs(j_start-j_end-2)<distance)
        {
            path.push("L");
            printPath(size-1,i_start,j_start-2,i_end,j_end,path);
            path.pop();
        }
    }
}

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.
    if(abs(i_start-i_end)%2==1)
    {
        cout<<"Impossible\n";
        return;
    }
    else
    {
        int steps=0; stack<string> path;
        if((abs(i_start-i_end)/2)%2==1)
        {
            if(abs(j_start-j_end)%2==0)
            {
                 cout<<"Impossible\n";
                 return;
            }
            if((abs(i_start-i_end))/2>=abs(j_start-j_end))
            {steps=abs(i_start-i_end)/2;//cout<<"here";
            }
            else
            {   steps=(abs(i_start-i_end)/2)+((abs(j_start-j_end)-(abs(i_start-i_end)/2))/2);//cout<<"here1";
            }
            cout<<steps<<"\n";
            printPath(steps,i_start,j_start,i_end,j_end,path);
        }
        else
        {
            if(abs(j_start-j_end)%2==1)
            {
                cout<<"Impossible\n";
                return;
            }
            if((abs(i_start-i_end))/2>=abs(j_start-j_end))
            {steps=abs(i_start-i_end)/2;//cout<<"here";
            }
            else
            {   steps=(abs(i_start-i_end)/2)+((abs(j_start-j_end)-(abs(i_start-i_end)/2))/2);//cout<<"here1";
            }
            cout<<steps<<"\n";
            printPath(steps,i_start,j_start,i_end,j_end,path);
        }

          
    }
}

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