#!/bin/python3

import sys

def printShortestPath(n, i1, j1, i2, j2):
    if i1==i2:
        if j1==j2:
            print("Impossible")
        
        elif j1%2==0:
            if j2%2==0:
                x=abs(j2-j1)/2
                print(x)
                if j2>j1:
                    for i in range(x):
                        print("R",end=" ")
                elif j1>j2:
                     for i in range(x):
                        print("L",end=" ")
               
                    
            else:
                print("Impossible")
        elif (j1%2)!=0:
            if j2%2!=0:
                x=abs(j2-j1)/2
                print(x)
                if j2>j1:
                    for i in range(x):
                        print("R",end=" ")
                elif j1>j2:
                     for i in range(x):
                        print("L",end=" ")
                
                    
            else:
                print("Impossible")
    elif  j1==j2:
        x=abs(i1-i2)
        if x==0:
            print("Impossible")
        elif x%4==0:
            print(x/2)
            for i in range(x/2):
                if i1>i2:
                    print("UR UL",end=" ")
                else:
                    print("LR LL",end=" ")
   # elif i2>i1:
        #if j2>j1:
        #    if i1%2==0:
                #if i2%2==0:
                   # if
                    
                
                

if __name__ == "__main__":
    n = int(input().strip())
    i1, j1, i2, j2 = input().strip().split(' ')
    i1, j1, i2, j2 = [int(i1), int(j1), int(i2), int(j2)]
    printShortestPath(n, i1, j1, i2, j2)