#!/bin/python3

import sys

def printShortestPath(n, i, j, u, v):
    l=[]
    p=0
    q=0
    c=0
    while(u!=i or v!=j ):
        p=i
        q=j
        if i-2>=0 and j-1>=0 and u<i and v<j and i-2>=u and j-1>=v:
            j-=1
            i-=2
            l.append('UL')
        if i-2>=0 and j+1<n and u<i and v>j and i-2>=u and j+1<=v:
            j+=1
            i-=2
            l.append('UR')
                
        if i+2<n and j+1<n and u>i and v>j and i+2<=u and j+1<=v:
            j+=1
            i+=2
            l.append('LR')
        if i+2<n and j-1>=0 and u>i and v<j and i+2<=u and j+1>=v:
            j-=1
            i+=2
            l.append('LL')
        if u==i:
            if v>j and j+2<=v and j+2<n:
                l.append('R')
                j+=2
            if v<j and j-2>=v and j-2>=0:
                l.append('L')
                j-=2
            
        if v==j:
          
            if i-2>=0 and j-1>=0 and u<i  and i-2>=u:
                j-=1
                i-=2
                l.append('UL')
            if i-2>=0 and j+1<n and u<i  and i-2>=u:
                j+=1
                i-=2
                l.append('UR')
                
            if i+2<n and j+1<n and u>i and i+2<=u:
                j+=1
                i+=2
                l.append('LR')
            if i+2<n and j-1>=0 and u>i and i+2<=u:
                j-=1
                i+=2
                l.append('LL')    
        if p==i and q==j:
            return 0
    print(len(l))
    print(" ".join(x for x in l ))
    return 1
            
    
            

if __name__ == "__main__":
    r=1
    n = int(input().strip())
    i, j, u, v = input().strip().split(' ')
    i, j, u, v = [int(i), int(j), int(u), int(v)]
    r=printShortestPath(n, i, j, u, v)
    if r==0:
        print("Impossible")