#!/bin/python3

import sys

def mapper(s):
    m = {'UL': (0,'UL'), 'UR': (1,'UR'), 'R': (2,'R'), 'LR': (3,'LR'), 'LL': (4,'LL'), 'L':(5,'L')}
    return m[s]

def printShortestPath(n, i_start, j_start, i_end, j_end):
    
    y = j_end-j_start
    x = i_end-i_start
    
    if abs(y)%2 != 0:
        print('Impossible')
        return
    
    st = []
    count=0
    while y!=0:
        if y<=0:
            j_start -= 2 #U
            if x<=0:
                i_start -= 1 #L
                st.append('UL')
            else:
                i_start += 1 #R
                st.append('UR')
        else:
            j_start += 2 #L
            if x<0:
                i_start -= 1 #L
                st.append('LL')
            else:
                i_start += 1 #R
                st.append('LR')
        if i_start<0 or i_start==n:
            print('Impossible')
            return
        y = j_end-j_start
        x = i_end-i_start
        count+=1
        
    if abs(x)%2 != 0:
        print('Impossible')
        return
    
    for i in range(abs(x)//2):
        if x<0: st.append('L')
        else: st.append('R')
        count+=1
    
    print(count)
    st = list(map(mapper, st))
    st.sort()
    st = list(map(lambda x: x[1] , st))
    print(*st)
    

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, j_start, i_start, j_end, i_end)