import sys

def check(i_end, j_end, i_start, j_start):
    j = abs(j_start-j_end)
    i = abs(i_end-i_start)
    
    if i%2 == 0:
        if not j%2 == (i/2)%2:
            return False
    if j%2 == 0:
        if not i%2 == 0:
            return False
    return True
    
def le(i, j, n):
    if j-2>=0: return i, j-2
    else: return i, j
def ri(i, j, n):
    if j+2<n: return i, j+2
    else: return i, j
def ul(i, j, n):
    if j-1>=0 and i-2>=0: return i-2, j-1
    else: return i, j
def ur(i, j, n):
    if j+1<n and i-2>=0: return i-2, j+1
    else: return i, j
def dr(i, j, n):
    if j+1<n and i+2<n: return i+2, j+1
    else: return i, j
def dl(i, j, n):
    if j-1>=0 and i+2<n: return i+2, j-1
    else: return i, j

c = False
def printShortestPath(n, i_start, j_start, i_end, j_end):
    global c
    if not c:
        checked = check(i_start, j_start, i_end, j_end)
        c= True
    if checked:
        ok = False
        j_pos = j_start
        i_pos = i_start
        i = i_pos
        j = j_pos
        moves = []
        while not ok:
            ur_ = j<j_end and i>i_end
            dr_ = j<j_end and i<i_end
            ul_ = j>j_end and i>i_end
            dl_ = j>j_end and i<i_end
            ri_ = i == i_end and j<j_end
            le_ = i == i_end and j>j_end
            u = j == j_end and i>i_end
            d = j == j_end and i<i_end
            
        
            if ul_:
                moves.append('UL')
                i, j = ul(i, j, n)
            elif ur_:
                i, j = ur(i, j, n)
                moves.append('UR')
            elif ri_:
                i, j = ri(i, j, n)
                moves.append('R')
            elif dr_:
                i, j = dr(i, j, n)
                moves.append('LR')
            elif dl_:
                i, j = dl(i, j, n)
                moves.append('LL')
            
            elif le_:
                i, j = le(i, j, n)
                moves.append('L')
            elif u:
                i1, j1 = ul(i, j, n)
                if not (i1, j1) == (i, j):
                    moves.append('UL')
                    i, j = i1, j1
                else:
                    i, j = ur(i, j, n)
                    moves.append('UR')
            elif d:
                i1, j1 = dr(i, j, n)
                if not (i1, j1) == (i, j):
                    i, j = i1, j1
                    moves.append('LR')
                else:
                    i, j = dl(i, j, n)
                    moves.append('LL')
                
##            print moves[-1]
            
            if i== i_end and j == j_end:
                ok = True
        print len(moves)
        for i in moves:
            print i,
    else:
        print 'Impossible'
                    
        
        

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)