#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    paths=[]
    impossible=False
    #print i_start, j_start , i_end, j_end
    if abs(i_start - i_end)%2 ==0:
        while ((i_start>=0) and (j_start>=0) and (i_start<n) and (j_start<n) and ((i_start!=i_end ) or (j_start!=j_end))):
            #print "here"
            if ((i_start>i_end) & (j_start>=j_end)):
                upleft = True
                i_start -=2
                j_start -=1
                paths.append('UL')
            elif ((i_start>i_end) & (j_start<j_end)):
                upright = True
                i_start -=2
                j_start +=1
                paths.append('UR')
            elif ((i_start==i_end) & (j_start<j_end)):    
                right = True
                j_start +=2
                paths.append('R')
            elif ((i_start<i_end) & (j_start<=j_end)):    
                lowright = True
                i_start +=2
                j_start +=1
                paths.append('LR')
            elif ((i_start<i_end) & (j_start>j_end)):
                lowleft = True
                i_start +=2
                j_start -=1
                paths.append('LL')
            elif ((i_start==i_end) & (j_start>j_end)):    
                left = True
                j_start -=2
                paths.append('L')
            else:
                impossible=True
            #print i_start, j_start , i_end, j_end
            #print paths
    else:
        impossible=True
    if (impossible or (i_start!=i_end) or (j_start!=j_end)):
        print "Impossible"
    else:
        print len(paths)
        print " ".join(e for e in paths)

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)