#include <bits/stdc++.h>
#include <iostream>
#include <vector>
using namespace std;

void printShortestPath(int n, int is, int js, int ie, int je) {
    //  Print the distance along with the sequence of moves.
    int flag=1;
    int no=0;
     std::vector<std::string> move;
     std::vector<std::string>:: iterator it ;
    if((ie-is)%2!=0)
        flag=0;
    else
    {
        while(is!= ie)
        {         
            if(is<ie && js>je)
            {
                is+=2;
                js-=1;
                move.push_back("LL");
            }
            else if(is<ie && js<je)
            {
                is+=2;
                js+=1;
                move.push_back("LR");
            }
            else if(is>ie && js>je)
            {
                is-=2;
                js-=1;
                move.push_back("UL");
            }
            else if(is>ie && js<je)
            {
                is-=2;
                js+=1;
                move.push_back("UR");
            }
            else if(is>ie && js==je)
            {
                is-=2;
                js-=1;
                move.push_back("UL");
            }
            else if(is<ie && js==je)
            {
                is+=2;
                js+=1;
                move.push_back("LR");
            }
            no++;
        }
        while(js!= je)
        {
            if((js-je)%2==1 || (je-js)%2==1)
            {
                flag=0;
                break;
            }
            if(js<je)
            {
                js+=2;
                move.push_back("R");
                no++; 
            }
            else
            {
                js-=2;
                move.push_back("L");
                no++;
            }   
        }
    }
        if(flag==0)
            cout<<"Impossible"<<endl;
        else
        {
            printf("%d\n",no);
            for(it= move.begin();it<move.end();it++)
               std::cout<< *it<<" ";
            std::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;
}