#!/bin/python3
import sys
def printShortestPath(n, i_start, j_start, i_end, j_end):
    count=0
    l=[]
    if(abs(i_start-i_end-1)%2==1):
        while(i_start!=i_end or j_start!=j_end):
            while(i_end<i_start and j_end<j_start):
                i_start-=2
                j_start-=1
                count+=1
                l.append('UL')
            while(i_end<i_start and j_end>j_start):
                i_start-=2
                j_start+=1
                count+=1
                l.append('UR')
            while(i_end==i_start and j_end>j_start):
                j_start+=2
                count+=1
                l.append('R')
            while(i_end>i_start and j_end>=j_start):
                i_start+=2
                j_start+=1
                count+=1
                l.append('LR')
            while(i_end>i_start and j_end<=j_start):
                i_start+=2
                j_start-=1
                count+=1
                l.append('LL')
            while(i_end==i_start and j_end<j_start):
                j_start-=2
                count+=1
                l.append('L')
        
        print(count)
        for q in range(len(l)):
            print(l[q],end=' ')
        
    else:
        print("Impossible")
    
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)