#!/bin/python3

import sys

def printShortestPath(n, i, j, d, e):
    #print(i,j,d,e)
    s=""
    cnt=0
    if abs(d-i)%2==0 and (abs(d-i)//2+abs(j-e))%2==0:
        
        while i!=d or j!=e:
            if i>=d:
                if e<=j and d<i and j!=0:
                    s+='UL '
                    cnt+=1
                    i-=2
                    j-=1
                    continue
                if e>j and d<i and j!=(n-1):
                    s+="UR "
                    cnt+=1
                    i-=2
                    j+=1
                    continue
                if d==i and e>j:
                    s+='R '
                    cnt+=1
                    j+=2
                    continue

                if d==i and e<j:
                    s+='L '
                    cnt+=1
                    j-=2
            else:
                if e>=j and d>i and j!=(n-1):
                    s+="LR "
                    cnt+=1
                    i+=2
                    j+=1
                    continue
                if d==i and e>j:
                    s+='R '
                    cnt+=1
                    j+=2
                    continue
                if e<=j and d>i and j!=0:
                    s+='LL '
                    cnt+=1
                    i+=2
                    j-=1
                    continue
                if d==i and e<j:
                    s+='L '
                    cnt+=1
                    j-=2
        print(cnt)
        print(s)  
    else:
        print("Impossible")
    
    
    
    
    #  Print the distance along with the sequence of moves.

if __name__ == "__main__":
    n = int(input().strip())
    i_start, j_start, i_end, j_end = 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)