#include <bits/stdc++.h>

using namespace std;

void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
    int step=0,c=0;
    string path;
    if((i_start+i_end)%2!=0)
        cout<<"Impossible\n";
    else{
        int i=i_start,j=j_start,reached=0;
        while(reached == 0)
        {
            if(i==i_end && j==j_end)
            {
                reached++;
            }
            else if(i>i_end && j<j_end && i>1 && j<n-1)
            {
                i-=2;j++;step++;
                path+="UR ";
            }
            else if(i==i_end && j<j_end && j<n-2)
            {
                j+=2;step++;
                path+="R ";
            }
            else if(i<i_end && j<j_end && i<n-2 && j<n-1)
            {
                i+=2;j++;step++;
                path+="LR ";
            }
            else if(i<i_end && j>j_end && i<n-2 && j>0)
            {
                i+=2;j--;step++;
                path+="LL ";
            }
            else if(i==i_end && j>j_end && j>1)
            {
                j-=2;step++;
                path+="L ";
            }
            else if(i>i_end && j>j_end && i>1 && j>0)
            {
                i-=2;j--;step++;
                path+="UL ";
            }
            else if(i<i_end && j==j_end && i<n-4)
            {
                if((i_end-i)%4!=0)
                {
                    reached++;
                    cout<<"Impossible\n";
                }
                else if(j==n-1)
                {
                    j--;path+="LL ";
                }
                else
                {
                    j++;path+="LR ";
                }
                i+=2;step++;
            }
            else if(i>i_end && j==j_end && i>3)
            {
                if((i-i_end)%4!=0)
                {
                    reached++;
                    cout<<"Impossible\n";
                }
                else if(j==n-1)
                {
                    j--;path+="UL ";
                }
                else
                {
                    j++;path+="UR ";
                }
                i-=2;step++;
            }
        }
        cout<<step<<endl;
        printf("%s\n",path.c_str());
    }
}

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