n = int(raw_input())
y0,x0,y1,x1 = map(int,raw_input().split())

found = False
mem  = [[None for x in range(n)]for y in range(n)]
mem[y0][x0] = []

queue = [(y0,x0)]
while queue:
    curr = queue.pop(0)
    
    if curr[0] == y1 and curr[1] == x1:
        found = True
        break
    
    st = list(mem[curr[0]][curr[1]])
    
    
    check_arr = [(curr[0]-2,curr[1]-1,"UL"),
                 (curr[0]-2,curr[1]+1,"UR"),
                 (curr[0],curr[1]+2,"R"),
                 (curr[0]+2,curr[1]+1,"LR"),
                 (curr[0]+2,curr[1]-1,"LL"),
                 (curr[0],curr[1]-2,"L")]
                
    for check in check_arr:
        
        if check[0] >= 0 and check[1] >= 0 and check[0]<n and check[1]<n:
            if mem[check[0]][check[1]] == None:
                queue.append((check[0],check[1]))
                mem[check[0]][check[1]] = st + [check[2]]

          
    
    
if found:
    ans = mem[curr[0]][curr[1]]
    print len(ans)
    print " ".join(ans)
else:
    print "Impossible"