#!/bin/python3

import sys

def printShortestPath(n, i_start, j_start, i_end, j_end):
    s=0
    c=0
    a="" 
    ll=""
    l=""
    FLAG=1
    new=4*n+10
    while((i_start!=i_end or j_start!=j_end  ) and len(a)<new):
        if(i_start<0 or j_start<0 or i_start>=n or j_start>=n or (ll=="LR" and l=="UL") or (ll=="UL" and l=="LR") or (ll=="UR" and l=="LL") or (ll=="LL" and l=="UR") or (ll=="L" and l=="R") or (ll=="R" and l=="L") or (ll=="UR" and l=="LR") or (ll=="LR" and l=="UR")or (ll=="UL" and l=="LL") or (ll=="LL" and l=="UL")):
            FLAG=0
            print("Impossible")
            break
        if(i_start>i_end and j_start>=j_end):
            i_start-=2
            j_start-=1
            a+="UL "
            ll=l
            l="UL"
            c+=1
        elif(i_start>i_end and j_start<=j_end):
            i_start-=2
            j_start+=1
            a+="UR "
            c+=1
            ll=l
            l="UR"
        elif(i_start==i_end and j_start<j_end):
            j_start+=2
            a+="R "
            c+=1
            ll=l
            l="R"
        elif(i_start<i_end and j_start<=j_end):
            i_start+=2
            j_start+=1
            a+="LR "
            c+=1
            ll=l
            l="LR"
        elif(i_start<i_end and j_start>=j_end):
            i_start+=2
            j_start-=1
            a+="LL "
            c+=1
            ll=l
            l="LL"
        elif(i_start==i_end and j_start>j_end):
            j_start-=2
            a+="L "
            c+=1
            ll=l
            l="L"
        else:
            FLAG=0
            print("Impossible")
            break
        if(i_start<0 or j_start<0 or i_start>=n or j_start>=n or (ll=="LR" and l=="UL") or (ll=="UL" and l=="LR") or (ll=="UR" and             l=="LL") or (ll=="LL" and l=="UR") or (ll=="L" and l=="R") or (ll=="R" and l=="L") or (ll=="UR" and l=="LR") or (ll=="LR" and             l=="UR") or (ll=="UL" and l=="LL") or (ll=="LL" and l=="UL")):
            FLAG=0
            print("Impossible")
            break

    if(FLAG!=0):
        print (c)
        print (a)
                

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)]
    if(i_start==i_end and j_start==j_end):
        print("Impossible")
    elif(n>i_start>=0, n>j_start>=0, n>i_end>=0, n>j_end>=0 and 5<=n<=200):
        printShortestPath(n, i_start, j_start, i_end, j_end)
    else:
        print("Impossible")