#!/bin/python


import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    lis=[];
    out='';
    if((abs(i_end - i_start) % 2) ==1):
        print "Impossible";
    elif((abs(i_end - i_start) / 2)%2 == 1):
        if((abs(j_end - j_start) % 2) == 0):
            print "Impossible";
        else:
            funct(j_start,i_start,j_end,i_end,lis);
            print len(lis);
            
            for i in lis:
                if(i=='UL'):
                    out=out+'UL ';
                elif(i=='UR'):
                    out=out+'UR ';
                elif(i=='R'):
                    out=out+'R ';
                elif(i=='LR'):
                    out=out+'LR ';
                elif(i=='LL'):
                    out=out+'LL ';
                elif(i=='L'):
                    out=out+'L ';
            print out
                  
                
    else:
        if((abs(j_end - j_start) % 2) == 1):
            print "Impossible";
        else:
            funct(j_start,i_start,j_end,i_end,lis);
            print len(lis);
           
            for i in lis:
                if(i=='UL'):
                    out=out+'UL ';
                elif(i=='UR'):
                    out=out+'UR ';
                elif(i=='R'):
                    out=out+'R ';
                elif(i=='LR'):
                    out=out+'LR ';
                elif(i=='LL'):
                    out=out+'LL ';
                elif(i=='L'):
                    out=out+'L ';
            print out
    #  Print the distance along with the sequence of moves.
def funct(j_start,i_start,j_end,i_end,lis):
    if((i_end - i_start) ==0):
        p=abs((j_end - j_start)/2)
        for i in range(0,p):
            if(i_end - i_start)>0:
                lis.append('R');
            else:
                lis.append('L');
    elif((j_end - j_start)==0):
        if((i_end - i_start)<0):
            p=abs((i_end - i_start)/2)
            if(p%2==0):
                for i in range (0, p/2):
                    lis.append('UL');
                for i in range (0, p/2):
                    lis.append('UR');
            else:
                for i in range (0, (p+1)/2):
                    lis.append('UL');
                for i in range (0, (p-1)/2):
                    lis.append('UR');
                lis.append('R');
        else:
            p=abs((i_end - i_start)/2)
            if(p%2==0):
                for i in range (0, p/2):
                    lis.append('LR');
                for i in range (0, p/2):
                    lis.append('LL');
            else:
                for i in range (0, (p+1)/2):
                    lis.append('LR');
                for i in range (0, (p-1)/2):
                    lis.append('LL');
                lis.append('L');
                    
    elif(j_end < j_start and i_end < i_start):
        lis.append('UL');
        funct(j_start-1,i_start-2,j_end,i_end,lis);
    elif(j_end > j_start and i_end < i_start):
        lis.append('UR');
        funct(j_start+1,i_start-2,j_end,i_end,lis);
    elif(j_end > j_start and i_end > i_start):
        lis.append('LR');
        funct(j_start+1,i_start+2,j_end,i_end,lis);
    elif(j_end < j_start and i_end > i_start):
        lis.append('LL');
        funct(j_start-1,i_start+2,j_end,i_end,lis);
            

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)