#!/bin/python

import sys

def printShortestPath(n, xs, ys, xe, ye):
    a=''
    px=xs
    py=ys
    if abs(xs-xe)%2==0 and xs>xe:
        if ys>ye:
            a+='UL '*(abs(xs-xe)//2)
            px=xs-abs(xs-xe)
            py-=(abs(xs-xe)//2)
        else: 
            a+='UR '*(abs(xs-xe)/2)
            px-=xs-abs(xs-xe)
            py+=(abs(xs-xe)//2)
    if abs(-xs+xe)%2==0 and xe>xs:
        if py>ye:
            a+='LR '*(abs(px-xe)//2)
            px+=abs(px-xe)
            py-=(abs(px-xe)//2)
        if py<ye:
            a+='LL '*(abs(xs-xe)/2)
            px-=abs(xs-xe)
            py+=(abs(xs-xe)//2)
    if (px==xe):
        if(ye-py)%2==0 and py<ye:
            a+='R '*(py-ye)//2
            py+=(py-ye)//2
        elif py>ye and (py-ye)%2==0: 
            a+='L '*((py-ye)//2)
            py-=(py-ye)
            
    
        
    if px==xe and py==ye:        
        print(len(a.split()))
        print(' '.join(a.split())  )
    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)