#!/bin/python

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    dikey = i_start-i_end
    yatay = j_start-j_end
    
    L = []
    dongu=0
    sayac=0
    
    if dikey%2 == 0:
        yataypos= (dikey%4)
        if yataypos == 2:
            if yatay%2 == 0:
                print 'Imposible'
            else:
                while dongu == 0:
                    dikey = i_start-i_end
                    yatay = j_start-j_end
                  
                    sayac=sayac+1
                    
                    
                    if dikey < 0 and yatay <=0:
                        L.append('LR')
                        i_start=i_start+2
                        j_start=j_start+1
                    if dikey < 0 and yatay > 0:
                        L.append('LL')
                        j_start=j_start-1
                        i_start=i_start+2
                    if dikey > 0 and yatay <=0:
                        L.append('UR')
                        i_start=i_start-2
                        j_start=j_start+1
                    if dikey >0 and yatay >0:
                        L.append('UL')
                        i_start=i_start-2
                        j_start=j_start-1
                        
                    elif dikey == 0 and yatay >0:
                        L.append('L')
                        j_start=j_start-2
                    elif dikey == 0 and yatay <0:
                        L.append('R')
                        j_start=j_start+2
                    if dikey == 0 and yatay ==0:
                        dongu=1
                print sayac-1
                for i in L:
                    print i,
        if yataypos == 0:
            if yatay%2 == 0:
                while dongu == 0:
                    dikey = i_start-i_end
                    yatay = j_start-j_end
                  
                    sayac=sayac+1
                    
                    
                    if dikey < 0 and yatay <=0:
                        L.append('LR')
                        i_start=i_start+2
                        j_start=j_start+1
                    if dikey < 0 and yatay > 0:
                        L.append('LL')
                        j_start=j_start-1
                        i_start=i_start+2
                    if dikey > 0 and yatay <=0:
                        L.append('UR')
                        i_start=i_start-2
                        j_start=j_start+1
                    if dikey >0 and yatay >0:
                        L.append('UL')
                        i_start=i_start-2
                        j_start=j_start-1
                        
                    elif dikey == 0 and yatay >0:
                        L.append('L')
                        j_start=j_start-2
                    elif dikey == 0 and yatay <0:
                        L.append('R')
                        j_start=j_start+2
                    if dikey == 0 and yatay ==0:
                        dongu=1
                print sayac-1
                for i in L:
                    print i,            
            else:
                print 'Impossible'
    
    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)