#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    #  Print the distance along with the sequence of moves.
    
    di = abs(i_end - i_start)
    dj = abs(j_end - j_start)
    if di % 2 != 0 :
        print("Impossible")
        return
    
    if dj % 2 != 0 and (di-2) % 4 != 0:
        print("Impossible")
        return
    
    if dj % 2 == 0 and di % 4 != 0:
        print("Impossible")
        return
        
    ns = 0
    ss = []
    i = i_start
    j = j_start
    while i != i_end or j != j_end:
        ns += 1
        
        if i_end == i:
            if j_end < j :
                j -= 2
                ss.append("L")
            else:
                j += 2
                ss.append("R")
            
            continue            
        
        if i_end < i:
            if j_end <= j:
                i -= 2
                j -= 1
                ss.append("UL")
                continue
                
            if j_end > j :
                i -= 2
                j += 1
                ss.append("UR")
                continue
                
        if i_end > i:
            if j_end < j:
                i += 2
                j -= 1
                ss.append("LL")
                continue
                
            if j_end >= j :
                i += 2
                j += 1
                ss.append("LR")
                continue
            
    print(ns)
    print(" ".join(ss))
    

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)