#!/bin/python

import sys

def printShortestPath(n, x1,y1,x2,y2):
    c=0
    l=[]
    k=0
    if (x1<x2):
        while (x1<x2):
            if(y1<y2):
                x1=x1+2
                y1=y1-1
                l.append('LL')
            elif y1>y2:
                x1=x1+2
                y1=y1+1
                l.append('LR')
            elif y1==y2:
                k=k+1
                x1=x1+2
                if k%2!=0:
                    l.append('LR')
                else:
                    l.append('LL')
           
            c=c+1    
        if(x1==x2)and(y1==y2):
            print c
            print " ".join(l)
    elif (x1>x2):
        while (x1>x2):
            if(y1<y2):
                x1=x1-2
                y1=y1+1
                l.append('UR')
            elif y1>y2:
                x1=x1-2
                y1=y1-1
                l.append('UL')
            elif y1==y2:
                k=k+1
                x1=x1+2
                if k%2!=0:
                    l.append('UR')
                else:
                    l.append('UL')
           
            c=c+1    
        if(y1>y2):
            while y1>y2:
                y1=y1-2
                l.append('L')
                c=c+1
        if(y1<y2):
            while y1<y2:
                y1=y1+2
                l.append('R')
                c=c+1
        if(x1==x2)and(y1==y2):
            print c
            print " ".join(l)
        else:
            print "Impossible"
                
            
                
               
         
             
    #  Print the distance along with the sequence of moves.

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)