#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    if(abs(i_start-i_end)%2==1):
        print "Impossible"
    else:
        out=""
        c=0
        if(i_start<i_end):
            while(i_start<i_end):
                if(j_start<j_end):
                    out+="LL "
                    j_start+=1
                else:
                    out+="LR "
                    j_start-=1
                c+=1
                i_start+=2
        elif(i_start>i_end):
            while(i_start>i_end):
                i_start-=2
                if(j_start<j_end):
                    out+="UR "
                    j_start+=1
                else:
                    out+="UL "
                    j_start-=1
                c+=1
        if(abs(j_start-j_end)%2==1):
            print "Impossible"
        else:
            if(j_start<j_end):
                while(j_start!=j_end):
                    out+="R "
                    j_start+=2
                    c+=1
            else:
                while(j_start!=j_end):
                    out+="L "
                    c+=1
                    j_start-=2
        print c
        print out
if __name__ == "__main__":
    n = int(raw_input().strip())
    i_start, j_start, i_end, j_end = raw_input().strip().split(' ')
    i_start, j_start, i_end, j_end = [int(i_start), int(j_start), int(i_end), int(j_end)]
    printShortestPath(n, i_start, j_start, i_end, j_end)