#include <bits/stdc++.h>

using namespace std;

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.
     string s;
    int sum=0;
    while((i_start!=i_end || j_start!=j_end) &&(i_start<n && j_start<n && i_start>=0 && j_start>=0))
    {
        if(i_start>i_end && j_start>=j_end)
        {
            i_start-=2;
            j_start-=1;
            s+="UL ";
        }
        else if(i_start>i_end && j_start<j_end)
        {
            i_start-=2;
            j_start+=1;
            s+="UR ";
        }
        else if(i_start<i_end && j_start<=j_end)
        {
            
                i_start+=2;
                j_start+=1;
                s+="LR ";
        }
        else if(i_start<i_end && j_start>j_end)
        {
            i_start+=2;
            j_start-=1;
            s+="LL ";
        }
        else if(i_start==i_end && j_start!=j_end )
        {
            if(j_start<j_end)
            {
                j_start+=2;
                s+="R ";
            }
            if(j_start>j_end)
            { 
                j_start-=2;
                s+="L ";
            }
        }
        sum++;
    }
   if(i_start==i_end && j_start==j_end)
   {
       cout<<sum<<endl;
       cout<<s<<endl;
   }
    else
        cout<<"Impossible"<<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;
}