#!/bin/python3

import sys
def printing(nn, stringa):
    for k in range(nn):
        print(stringa)
        if k<nn-1:print(' ')
def checkpar(ina):
    if ina/2!=int(ina/2):return(0) 
    if ina/2==int(ina/2):return(1)
        

def printShortestPath(n, i_start, j_start, i_end, j_end):
    yy=i_end-i_start
    xx=j_end-j_start
    #print(xx,yy)
    flag=0
    if xx/2!=int(xx/2) and xx!=0:xxpar=0
    elif xx/2==int(xx/2) and xx!=0:xxpar=1
    elif xx==0:xxpar=2
    if yy/2!=int(yy/2) and yy!=0 and flag==0:print('Impossible');flag=1 
    if yy==0 and xxpar==0 and flag==0:print('Impossible');flag=1
    elif yy==0 and xxpar==1:
        xx_temp=int(abs(xx/2))
        if xx<0:printing(xx_temp,'ll')
        if xx>0:printing(xx_temp,'rr')  
    if yy!=0 and xx==0 and flag==0:print('Impossible');flag=1
    elif yy!=0 and xx!=0:
        xx_temp=int(abs(xx/2))
        yy_temp=int(abs(yy/2))
        if checkpar(yy)==0 and flag==0:print('Impossible');flag=1

                
        
        
    
    
    
    

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)